• Title/Summary/Keyword: data update

Search Result 1,134, Processing Time 0.033 seconds

A TEST Frame Application Technique for Improving Data Communication and Topology Update Function in Ad-Hoc Tactical Wireless Networks (Ad-Hoc 전술 무선 통신망에서 데이터 통신 및 토폴로지 갱신 기능 향상을 위한 TEST 프레임 적용 기법)

  • You, Ji-Sang;Baek, In-Cheol
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.10 no.1
    • /
    • pp.44-54
    • /
    • 2007
  • In the military field, according to the MIL-STD-188-220, which is an Ad-Hoc communication protocol used for sending out or receiving data and voice smoothly among nodes in the situation that wireless communication nodes move arbitrarily, data communication is cut off because nodes can not know topology changes perpetually in the link disconnection state due to node movement in the case that transmitters do not confirm whether data is delivered to receivers or not, and transmit only the data having routine precedence continuously. In order to solve this problem, we have proposed the technique that makes efficient data communication possible by achieving a rapid topology change detection and link information update using TEST frame. We have analyzed TEST frame application effects in the two aspects of the topology update delay time and the data transmission success ratio.

Update Facility for XML Schema (XML 스키마를 위한 갱신 기능)

  • Lee, Ki-Jun;Hwang, Soo-Chan
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.3
    • /
    • pp.324-330
    • /
    • 2010
  • XML schema is widely used as an effective tool for organizing and validating XML data. Although W3C released XQuery and XQuery Update Facility as the standard methods for searching and updating XML data, there is no consideration about providing facilities for updating XML schema itself until now. So users can only update an XML schema file directly by using editors. However, the direct update has several problems: It cannot prevent user's illegal update; it is hard to apply to the XML schemas stored in databases, needs much time to analyze schema, and is likely to make syntactic errors. In this paper, we propose an XML schema update facility, which enables creation, deletion and modification of XML schema by using commands.

Design and Implementation of Update Propagation Technique for Update Spatio-Temporal Data in Mobile Environments (모바일 환경에서 갱신된 시공간 데이터의 변경전파 기법의 설계 및 구현)

  • Kim, Hong-Ki;Kim, Dogn-Hyun;Cho, Dae-Soo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.2
    • /
    • pp.395-403
    • /
    • 2011
  • Various studies were performed for providing the latest spatio-temporal information in mobile GIS Environments. The two-way synchronization scheme collects updated spatio-temporal data in the field and synchronizes with a server by using the wireless network. However, the other mobile terminals have to perform periodically synchronizes with a server. In this paper, we propose the update propagation scheme about spatio-temporal data collected from the mobile terminal. The update propagation scheme does considering various factors where an influence is in the update propagation. Therefore, it provides various update propagation policies according to each factors.

A System Framework for Map Air Update Navigation Service

  • Min, Kyoung-Wook;An, Kyoung-Hwan;Jang, In-Sung;Jin, Sung-Il
    • ETRI Journal
    • /
    • v.33 no.4
    • /
    • pp.476-486
    • /
    • 2011
  • The quality of navigation service is determined by the accuracy of the available data. For existing navigation services, a full map update is provided in order to keep the map data of mobile devices current. As content and services of mobile devices have recently been diversifying, the size of map data managed in mobile devices has increased, reaching several gigabytes in size. It generally takes tens of minutes to write several gigabytes of data into mobile device storage. For traditional navigation systems, a complicated storage structure called a physical storage format (PSF) is used to assure maximum processing performance of map data in mobile devices within limited resources. Consequently, even though modified navigation map data actually affects only a portion of a map, the full map data is updated because partial updates are not possible. In this paper, a navigation system is studied to solve this difficult partial map update problem. The map air update navigation system, which is the result of this study, provides real-time partial map updating using wireless communications.

Improved Hot data verification considering the continuity and frequency of data update requests (데이터 갱신요청의 연속성과 빈도를 고려한 개선된 핫 데이터 검증기법)

  • Lee, Seungwoo
    • Journal of Internet of Things and Convergence
    • /
    • v.8 no.5
    • /
    • pp.33-39
    • /
    • 2022
  • A storage device used in the mobile computing field should have low power, light weight, durability, etc., and should be able to effectively store and manage large-capacity data generated by users. NAND flash memory is mainly used as a storage device in the field of mobile computing. Due to the structural characteristics of NAND flash memory, it is impossible to overwrite in place when a data update request is made, so it can be solved by accurately separating requests that frequently request data update and requests that do not, and storing and managing them in each block. The classification method for such a data update request is called a hot data identification method, and various studies have been conducted at present. This paper continuously records the occurrence of data update requests using a counting filter for more accurate hot data validation, and also verifies hot data by considering how often the requested update requests occur during a specific time.

Energy-Aware Node Selection Scheme for Code Update Protocol (코드 업데이트 프로토콜에서 에너지 잔존량에 따른 노드선정 기법)

  • Lee, Seung-Il;Hong, Won-Kee
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.5 no.1
    • /
    • pp.39-45
    • /
    • 2010
  • As wireless sensor network are being deployed in a wide variety of application areas, the number of sensor nodes in a sensor filed becomes larger and larger. In the past, ISP (In-System Programming) method have been generally used for code update but the large number of sensor nodes requires a new code update method called network reprogramming. There are many challenging issues for network reprogramming since it can make an impact on the network lifetime. In this paper, a new sender selection scheme for network reprogramming protocol is proposed to decrease energy consumption for code update by minimizing overlapped area between sender nodes and reducing data contention. Simulation results show that the proposed scheme can reduce the amount of message traffic and the overall data transmission time.

An Update-Efficient, Disk-Based Inverted Index Structure for Keyword Search on Data Streams (데이터 스트림에 대한 키워드 검색을 위한, 효율적인 갱신이 가능한 디스크 기반 역색인 구조)

  • Park, Eun Ju;Lee, Ki Yong
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.5 no.4
    • /
    • pp.171-180
    • /
    • 2016
  • As social networking services such as twitter become increasingly popular, data streams are widely prevalent these days. In order to search data accumulated from data streams efficiently, the use of an index structure is essential. In this paper, we propose an update-efficient, disk-based inverted index structure for efficient keyword search on data streams. When new data arrive at the data stream, the index needs to be updated to incorporate the new data. The traditional inverted index is very inefficient to update in terms of disk I/O, because all index data stored in the disk need to be read and written to the disk each time the index is updated. To solve this problem, we divide the whole inverted index into a sequence of inverted indices with exponentially increasing size. When new data arrives, it is first inserted into the smallest index and, later, the small indices are merged with the larger indices, which leads to a small amortize update cost for each new data. Furthermore, when indices stored in the disk are merged with each other, we minimize the disk I/O cost incurred for the merge operation, resulting in an even smaller update cost. Through various experiments, we compare the update efficiency of the proposed index structure with the previous one, and show the performance advantage of the proposed structure in terms of the update cost.

Data Update on Multi-Scale Databases (다중축척 공간 데이터베이스의 데이터 갱신)

  • Kwon O-Je;Kang Hae-Kyong;Li Ki-Joune
    • Spatial Information Research
    • /
    • v.12 no.3
    • /
    • pp.239-249
    • /
    • 2004
  • This paper discusses on the update problem of multi-scale databases when the multi-scale databases, which is several spatial databases covering the same geographic area with different scales, are derived from an original one. Although the integrity between original and derived multi-scale databases should be maintained, most of update mechanisms do not 6respect it since the update mechanisms have assumed that the update of source objects propagates to objects directly derived from the source. In order to maintain the integrity of multi-scale databases during updates, we must propagate updates of sources to objects derived from both the updated source objects and other related objects. It is an important functional requirement of multi-scale database systems, which has not been supported by existing spatial database systems. In this paper, we propose a set of rules and algorithms for the update propagation and show a prototype developed on ArcGIS of ESRI. Our update mechanism provides with not only the consistency between multi-scale databases but also incremental updates.

  • PDF

An Efficient Technique for Processing Frequent Updates in the R-tree (R-트리에서 빈번한 변경 질의 처리를 위한 효율적인 기법)

  • 권동섭;이상준;이석호
    • Journal of KIISE:Databases
    • /
    • v.31 no.3
    • /
    • pp.261-273
    • /
    • 2004
  • Advances in information and communication technologies have been creating new classes of applications in the area of databases. For example, in moving object databases, which track positions of a lot of objects, or stream databases, which process data streams from a lot of sensors, data Processed in such database systems are usually changed very rapidly and continuously. However, traditional database systems have a problem in processing these rapidly and continuously changing data because they suppose that a data item stored in the database remains constant until It is explicitly modified. The problem becomes more serious in the R-tree, which is a typical index structure for multidimensional data, because modifying data in the R-tree can generate cascading node splits or merges. To process frequent updates more efficiently, we propose a novel update technique for the R-tree, which we call the leaf-update technique. If a new value of a data item lies within the leaf MBR that the data item belongs, the leaf-update technique changes the leaf node only, not whole of the tree. Using this leaf-update manner and the leaf-access hash table for direct access to leaf nodes, the proposed technique can reduce update cost greatly. In addition, the leaf-update technique can be adopted in diverse variants of the R-tree and various applications that use the R-tree since it is based on the R-tree and it guarantees the correctness of the R-tree. In this paper, we prove the effectiveness of the leaf-update techniques theoretically and present experimental results that show that our technique outperforms traditional one.

An Algorithm Application Study on the Updating Digital Maps (수치지도 수시갱신을 위한 알고리즘 적용 연구)

  • Park, Chung;Lee, Ho-Nam;Park, Ki-Suk;Oh, Se-Jung
    • Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
    • /
    • 2009.04a
    • /
    • pp.135-143
    • /
    • 2009
  • The purpose of this research is to reduce editors' workload and automation to update(v) Digital Map(n) regarding changed topography. In Digital Map case, it usually uses the way of various survey to update(v). In this case, it costs a great deal and doesn't be efficient backup management. Accordingly, it can reduce editors' the period of the process and be efficiently managed the backup data due to well organized backup data management. We present update plan that used clipping and join for this result by analyzing Boundary of input data.

  • PDF