Abstract:
PURPOSE: A method and apparatus for managing column based data are provided to efficiently manage column based data by dividing the column based data if the file size of particular column group data subject to a partition composed of one row exceeds the partition division reference. CONSTITUTION: A method for managing column based data comprises the steps of: determining whether or not the file size of column group data exceeds the partition division reference(S310); dividing the column based data, if the file size of the column based data exceeds the partition division reference(S320); generating the divided column group data files by dividing the column group data(S330).
Abstract:
A large capacity high dimensional data indexing device supporting high-expandability in a cluster environment and a method thereof are provided to filter content-based search about high dimensional data first by using a spill tree and perform parallel search by using a signature in each node, thereby supporting rapid performance. A spill tree generation unit(210) generates a spill tree by extracting a sample of an N-dimensional feature vector. A feature vector divided storage unit(220) dividedly stores the N-dimensional feature vector in a terminal node of the spill tree. A local signature generation unit generates a signature locally about the N-dimensional feature vector distributed into each node of the spill tree.
Abstract:
A device and a method for processing continuous queries sharing a result of the queries for an XML(extensible Markup Language) data stream are provided to improve continuous query processing performance with reduction of repeated operation by sharing the result for common operation shared among the continuous queries. A syntax analyzer(520) checks a syntax error by receiving continuous queries registered from an external application/user(510), checks a semantic error of a syntax analysis result received from the syntax analyzer, and transfers a semantic analysis result. A semantic analyzer(530) checks a semantic error of the syntax analysis result received from the syntax analyzer and transfers the semantic analysis result. A sharable operation extractor(540) extracts operations sharable among a plurality of continuous queries and stores a result of the extracted sharable operation separately. A query executor(550) executes the continuous query for an XML data stream by using a sharable operation result while rounding the semantic analysis result and outputs the result to the outside.
Abstract:
본 발명은 XML 형태로 표현된 스트리밍 데이터 처리를 위한 XML 질의어 기반 연속 질의 언어 처리 시스템 및 방법에 관한 것으로서, 기존의 XML 질의어에 스트리밍 데이터 검색을 위하여 필요로 하는 기능을 추가하여 XML 질의 언어가 가지는 기본적인 특징은 유지하면서도 스트리밍 데이터를 접근할 수 있는 XML 질의어 기반 연속 질의 언어 처리 시스템 및 방법을 제공함으로써, 스트림 형태로 전송되는 데이터를 일관된 방식으로 처리할 수 있으며, 이력 데이터의 검색과 관련되어 기존의 XML 데이터 검색 시스템이 제공하는 API를 그대로 활용할 수 있다는 장점이 있다. XML, 센서, 스트리밍 데이터, 연속 질의
Abstract:
본 발명은 연속되어 입력되는 XML 문서 스트림을 주기적으로 서비스(웹서비스, JMS) 호출로 연계하는 방법에 관한 것으로, 유비쿼터스 컴퓨팅 환경의 XML 데이터 스트림 처리기에서 XML 문서에 대한 연속질의(Continuous Query)의 결과로 생성되는 XML 문서를 서비스(웹서비스, JMS) 호출로 변환시킴으로써, 연속질의를 이용하여 정의한 컨텍스트(상황, 狀況)와 이에 대한 서비스(웹서비스, JMS)를 자동으로 연계할 수 있도록 하는 효과가 있다. XML 문서, 웹서비스, JMS, 유비쿼터스, 연속질의, 컨텍스트
Abstract:
PURPOSE: A method for recovering for a high dimensional index structure is provided to secure an efficient recovery in a reinsertion calculation based on an ARIES(Algorithm for recovery and isolation exploiting semantics) and a page-oriented re-performing and a page-oriented recovery. CONSTITUTION: An "NTA" is started for recovering a deletion of one reinsertion entry(200). The number of remaining entries which are not inserted in a node to be performed a recovery are read, and the entries are inserted in a node to be performed a recovery as the number of entries which are not inserted and remains out of the deleted entries which are recorded in a log record. In addition, a log record in the case that a partial or all reinsertion entries are inserted is recorded when a log record is recovered at a deletion of a reinsertion entry selected in a terminal or non-terminal node(201). After the entry is inserted, the changed minimum boundary area is reflected in an ancestor node(202), and the "dummyCLR" meaning that one recovery process of a reinsertion entry is completed is recorded(203), and the process is restored.
Abstract:
PURPOSE: A data stream distribution parallelization processing service management device and a method thereof are provided to arrange plural tasks effectively by the load property, and to reduce the data input/output load among service tasks by the explosive increase of the input data stream forming the task comprising the service by using a communications means suitable for a task layout structure. CONSTITUTION: A service management unit(412) registers plural tasks comprising a data stream distribution parallelization processing service. A service quality monitoring unit(413) collects load information of the tasks, and load information of plural nodes forming a cluster which provides the data stream distribution parallelization processing service. A scheduling unit(414) distributes and arranges the tasks to the nodes based on the load information. [Reference numerals] (301) Task 1; (302) Task 2; (303) Task 3; (411) Task stream distribution parallelization processing service management device; (412) Service management unit; (413) Service quality monitoring unit; (414) Scheduling unit; (421,431,441) Task operating device; (422,432,442) Task management unit; (423,433,443) Local monitoring unit; (450) Input data stream source; (460) Output data stream source; (AA) Node 1; (BB) Node 2; (CC,DD) Node 3
Abstract:
PURPOSE: A cluster data management system and a method for data recovery using parallel processing thereof in a cluster data management system are provided to reduce the input/output of a disk in a reprocessing log access for data recovery by splitting a reprocessing log into rows of a partition. CONSTITUTION: A partition server(12-1 to 12-n) records a reprocessing log according to a service of a partition and is in the charge of a service for a partition. When an error happens in a partition server, a mater server(11) splits the reprocessing log into the rows of the partition and selects the partition server for reestablishing the partition based on the split reprocessing log. The mater server arranges the reprocessing log in an ascending order based on the reference information.