• Title, Summary, Keyword: Aggregation Query

Search Result 57, Processing Time 0.033 seconds

Ontology Versions Management on the Semantic Web

  • Yun, Hong-Won
    • Journal of information and communication convergence engineering
    • /
    • v.2 no.1
    • /
    • pp.26-31
    • /
    • 2004
  • In the last few years, The Semantic Web has increased the interest in ontologies. Ontology is an essential component of the semantic web. Ontologies continue to change and evolve. We consider the management of versions in ontology. We study a set of changes based on domain changes, changes in conceptualization, metadata changes, and temporal dimension. In many cases, we want to be able to search in historical versions, query changes in versions, retrieve versions on the temporal dimension. In order to support an ontology query language that supports temporal operations, we consider temporal dimension includes transaction time and valid time. Ontology versioning brings about massive amount of versions to be stored and maintained. We present the storage policies that are storing all the versions, all the sequence of changed element, all the change sets, the aggregation of change sets periodically, and the aggregation of change sets using a criterion. We conduct a set of experiments to compare the performance of each storage policies. We present the experimental results for evaluating the performance of different storage policies from scheme 1 to scheme 5.

Semantic Rewrite Rules at Object Oriented Query processing (객체 지향 질의 처리에서 의미적 재작성 규칙에 관한 연구)

  • Lee, Hong-Ro;Kwak, Hoon-Sung;Ryu, Keun-Ho
    • The Transactions of the Korea Information Processing Society
    • /
    • v.2 no.4
    • /
    • pp.443-452
    • /
    • 1995
  • Object-oriented database systems have been proposed as an effective solution for providing the data management facilities of complex applications. Proving this claim and the investigation of related issues such as query processing have been hampered by the absence of a formal object-oriented query model. In this paper, we not only define a query model based on aggregation inheritance but also develop semantic rewriting rules which are applied to equivalence preserving rewrite rules in algebraic expression of a query. Analyzing semantically the query model, the query model can be optimized to logically object-oriented query processing. And algebra expresstions of a query can be optimized by applying equivalence preserving rewrite rules.

  • PDF

An Energy Efficient Continuous Skyline Query Processing Method in Wireless Sensor Networks (무선 센서 네트워크 환경에서 에너지 효율적인 연속 스카이라인 질의 처리기법)

  • Seong, Dong-Ook;Yeo, Myung-Ho;Yoo, Jae-Soo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.4
    • /
    • pp.289-293
    • /
    • 2009
  • In sensor networks, many methods have been proposed to process in-network aggregation effectively. Contrary to normal aggregation queries, skyline query processing that compare multi-dimension data for producing result is very hard. It is important to filter unnecessary data for energy-efficient skyline query processing. Existing approach like MFTAC restricts unnecessary data transitions by deploying filters to whole sensors. However, network lifetime is reduced by energy consumption for filters transmission. In this paper, we propose a lazy filtering-based skyline query processing algorithm of in-network for reducing energy consumption by filters transmission. The proposed algorithm creates the skyline filter table (SFT) in the data gathering process which sends from sensor nodes to the base station and filters out unnecessary transmissions using it. The experimental results show that the proposed algorithm reduces false positive by 53% and improves network lifetime by 44% on average over MFTAC.

In-network Aggregation Query Processing using the Data-Loss Correction Method in Data-Centric Storage Scheme (데이터 중심 저장 환경에서 소설 데이터 보정 기법을 이용한 인-네트워크 병합 질의 처리)

  • Park, Jun-Ho;Lee, Hyo-Joon;Seong, Dong-Ook;Yoo, Jae-Soo
    • Journal of KIISE:Databases
    • /
    • v.37 no.6
    • /
    • pp.315-323
    • /
    • 2010
  • In Wireless Sensor Networks (WSNs), various Data-Centric Storages (DCS) schemes have been proposed to store the collected data and to efficiently process a query. A DCS scheme assigns distributed data regions to sensor nodes and stores the collected data to the sensor which is responsible for the data region to process the query efficiently. However, since the whole data stored in a node will be lost when a fault of the node occurs, the accuracy of the query processing becomes low, In this paper, we propose an in-network aggregation query processing method that assures the high accuracy of query result in the case of data loss due to the faults of the nodes in the DCS scheme. When a data loss occurs, the proposed method creates a compensation model for an area of data loss using the linear regression technique and returns the result of the query including the virtual data. It guarantees the query result with high accuracy in spite of the faults of the nodes, To show the superiority of our proposed method, we compare E-KDDCS (KDDCS with the proposed method) with existing DCS schemes without the data-loss correction method. In the result, our proposed method increases accuracy and reduces query processing costs over the existing schemes.

Efficient Processing of Aggregate Queries in Wireless Sensor Networks (무선 센서 네트워크에서 효율적인 집계 질의 처리)

  • Kim, Joung-Joon;Shin, In-Su;Lee, Ki-Young;Han, Ki-Joon
    • Spatial Information Research
    • /
    • v.19 no.3
    • /
    • pp.95-106
    • /
    • 2011
  • Recently as efficient processing of aggregate queries for fetching desired data from sensors has been recognized as a crucial part, in-network aggregate query processing techniques are studied intensively in wireless sensor networks. Existing representative in-network aggregate query processing techniques propose routing algorithms and data structures for processing aggregate queries. However, these aggregate query processing techniques have problems such as high energy consumption in sensor nodes, low accuracy of query processing results, and long query processing time. In order to solve these problems and to enhance the efficiency of aggregate query processing in wireless sensor networks, this paper proposes Bucket-based Parallel Aggregation(BPA). BPA divides a query region into several cells according to the distribution of sensor nodes and builds a Quad-tree, and then processes aggregate queries in parallel for each cell region according to routing. And it sends data in duplicate by removing redundant data, which, in turn, enhances the accuracy of query processing results. Also, BPA uses a bucket-based data structure in aggregate query processing, and divides and conquers the bucket data structure adaptively according to the number of data in the bucket. In addition, BPA compresses data in order to reduce the size of data in the bucket and performs data transmission filtering when each sensor node sends data. Finally, in this paper, we prove its superiority through various experiments using sensor data.

Energy-Efficient Routing for Data Collection in Sensor Networks (센서 네트워크에서의 데이타 수집을 위한 라우팅 기법)

  • Song, In-Chul;Roh, Yo-Han;Hyun, Dong-Joon;Kim, Myoung-Ho
    • Journal of KIISE:Databases
    • /
    • v.33 no.2
    • /
    • pp.188-200
    • /
    • 2006
  • Once a continuous query, which is commonly used in sensor networks, is issued, the query is executed many times with a certain interval and the results of those query executions are collected to the base station. Since this comes many communication messages continuously, it is important to reduce communication cost for collecting data to the base station. In sensor networks, in-network processing reduces the number of message transmissions by partially aggregating results of an aggregate query in intermediate nodes, or merging the results in one message, resulting in reduction of communication cost. In this paper, we propose a routing tree for sensor nodes that qualify the given query predicate, called the query specific routing tree(QSRT). The idea of the QSRT is to maximize in-network processing opportunity. A QSRT is created seperately for each query during dissemination of the query. It is constructed in such a way that during the collection of query results partial aggregation and packet merging of intermediate results can be fully utilized. Our experimental results show that our proposed method can reduce message transmissions more than 18% compared to the existing one.

A Review of Window Query Processing for Data Streams

  • Kim, Hyeon Gyu;Kim, Myoung Ho
    • Journal of Computing Science and Engineering
    • /
    • v.7 no.4
    • /
    • pp.220-230
    • /
    • 2013
  • In recent years, progress in hardware technology has resulted in the possibility of monitoring many events in real time. The volume of incoming data may be so large, that monitoring all individual data might be intractable. Revisiting any particular record can also be impossible in this environment. Therefore, many database schemes, such as aggregation, join, frequent pattern mining, and indexing, become more challenging in this context. This paper surveys the previous efforts to resolve these issues in processing data streams. The emphasis is on specifying and processing sliding window queries, which are supported in many stream processing engines. We also review the related work on stream query processing, including synopsis structures, plan sharing, operator scheduling, load shedding, and disorder control.

TLF: Two-level Filter for Querying Extreme Values in Sensor Networks

  • Meng, Min;Yang, Jie;Niu, Yu;Lee, Young-Koo;Jeong, Byeong-Soo;Lee, Sung-Young
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • /
    • pp.870-872
    • /
    • 2007
  • Sensor networks have been widely applied for data collection. Due to the energy limitation of the sensor nodes and the most energy consuming data transmission, we should allocate as much work as possible to the sensors, such as data compression and aggregation, to reduce data transmission and save energy. Querying extreme values is a general query type in wireless sensor networks. In this paper, we propose a novel querying method called Two-Level Filter (TLF) for querying extreme values in wireless sensor networks. We first divide the whole sensor network into domains using the Distributed Data Aggregation Model (DDAM). The sensor nodes report their data to the cluster heads using push method. The advantages of two-level filter lie in two aspects. When querying extreme values, the number of pull operations has the lower boundary. And the query results are less affected by the topology changes of the wireless sensor network. Through this method, the sensors preprocess the data to share the burden of the base station and it combines push and pull to be more energy efficient.

  • PDF

Design and Implementation of a Data Mining Query Processor (데이터 마이닝 질의 처리를 위한 질의 처리기 설계 및 구현)

  • Kim, Chung-Seok;Kim, Kyung-Chang
    • The KIPS Transactions:PartD
    • /
    • v.8D no.2
    • /
    • pp.117-124
    • /
    • 2001
  • A data mining system includes various data mining functions such as aggregation, association and classification, among others. To express these data mining function, a powerful data mining query language is needed. In addition, a graphic user interface(GUI) based on the data mining query language is needed for users. In addition, processing a data mining query targeted for a data warehouse, which is the appropriate data repository for decision making, is needed. In this paper, we first build a GUI to enable users to easily define data mining queries. We then propose a data mining query processing framework that can be used to process a data mining query targeted for a data warehouse. We also implement a schema generate a data warehouse schema that is needed to build a data warehouse. Lastly, we show the implementation details of a query processor that can process queries that discover association rules.

  • PDF

Index based on Constraint Network for Spatio-Temporal Aggregation of Trajectory in Spatial Data Warehouse

  • Li Jing Jing;Lee Dong-Wook;You Byeong-Seob;Oh Young-Hwan;Bae Hae-Young
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.12
    • /
    • pp.1529-1541
    • /
    • 2006
  • Moving objects have been widely employed in traffic and logistic applications. Spatio-temporal aggregations mainly describe the moving object's behavior in the spatial data warehouse. The previous works usually express the object moving in some certain region, but ignore the object often moving along as the trajectory. Other researches focus on aggregation and comparison of trajectories. They divide the spatial region into units which records how many times the trajectories passed in the unit time. It not only makes the storage space quite ineffective, but also can not maintain spatial data property. In this paper, a spatio-temporal aggregation index structure for moving object trajectory in constrained network is proposed. An extended B-tree node contains the information of timestamp and the aggregation values of trajectories with two directions. The network is divided into segments and then the spatial index structure is constructed. There are the leaf node and the non leaf node. The leaf node contains the aggregation values of moving object's trajectory and the pointer to the extended B-tree. And the non leaf node contains the MBR(Minimum Bounding Rectangle), MSAV(Max Segment Aggregation Value) and its segment ID. The proposed technique overcomes previous problems efficiently and makes it practicable finding moving object trajectory in the time interval. It improves the shortcoming of R-tree, and makes some improvement to the spatio-temporal data in query processing and storage.

  • PDF