• Title, Summary, Keyword: partial query

Search Result 44, Processing Time 0.048 seconds

A Data-Driven Query Processing Method for Stream Data (스트림 데이터를 위한 데이터 구동형 질의처리 기법)

  • Min, Mee-Kyung
    • Journal of Digital Contents Society
    • /
    • v.8 no.4
    • /
    • pp.541-546
    • /
    • 2007
  • Traditional query processing method is not efficient for continuous queries with large continuous stream data. This paper proposes a data-driven query processing method for stream data. The structure of query plan and query execution method are presented. With the proposed method, multiple query processing and sharing among queries can be achieved. Also query execution time can be reduced by storing partial results of query execution. This paper showed an example of query processing with XML data and XQuery query.

  • PDF

Linear Path Query Processing using Backward Label Path on XML Documents (역방향 레이블 경로를 이용한 XML 문서의 선형 경로 질의 처리)

  • Park, Chung-Hee;Koo, Heung-Seo;Lee, Sang-Joon
    • Journal of Korean Institute of Intelligent Systems
    • /
    • v.17 no.6
    • /
    • pp.766-772
    • /
    • 2007
  • As XML is widely used, many researches on the XML storage and query processing have been done. But, previous works on path query processing have mainly focused on the storage and retrieval methods for a large XML document or XML documents had a same DTD. Those researches did not efficiently process partial match queries on the differently-structured document set. To resolve the problem, we suggested a new index structure using relational table. The method constructs the $B^+$-tree index using backward label paths instead of forward label paths used in previous researches for storing path information and allows for finding the label paths that match the partial match queries efficiently using it when process the queries.

(A Study of an Exact Match and a Partial Match as an Information Retrieval Technique) (완전 매치와 부분 매치 검색 기법에 관한 연구)

  • 김영귀
    • Journal of the Korean Society for information Management
    • /
    • v.7 no.1
    • /
    • pp.79-95
    • /
    • 1990
  • A retrieval technique was defined as a technique for comparing the document representations. So this study classified retrieval technique in terms of the charactristics of the retrieved set of documents and the representations that are used. The distinction is whether the set of retrieved documents contains only documents whose representations are an exact match with the query, or a partial match with query. For a partial match, the set of retrieved document will include also those that are an exact match with the query. Boolean-logic as one of the exact match retrieval techniques is in current in most of the large operational information retrieval systems despite of its problems and limitatlons. Partial match as an alternative technique has also various problems. Existing information retrieval systems are successful in aSSisting the user whose needs are well- defined (e.g. Boolean-logic), to retrieve relevant documents but it should be successful in providing retrieval assistance to the browser whose information requirements is ill-defined.

  • PDF

Design and Implementation of a Boundary Matching System Supporting Partial Denoising for Large Image Databases

  • Kim, Bum-Soo;Kim, Jin-Uk
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.5
    • /
    • pp.35-40
    • /
    • 2019
  • In this paper, we design and implement a partial denoising boundary matching system using indexing techniques. Converting boundary images to time-series makes it feasible to perform a fast search using indexes even on a very large image database. Thus, using this converting method we develop a client-server system based on the previous partial denoising research in the GUI(graphical user interface) environment. The client first converts a query image given by a user to a time-series and sends denoising parameters and the tolerance with this time-series to the server. The server identifies similar images from the index by evaluating a range query, which is constructed using inputs given from the client and sends the resulting images to the client. Experimental results show that our system provides many intuitive and accurate matching results.

Efficient Data Storage & Query Processing Methods in Military Ubiquitous Sensor Networks (군 USN 환경에서 효율적인 데이터 저장 및 질의 처리 방법 연구)

  • Kwon, Young-Mo;Choi, Hyun-Sik;Chung, Yon-Dohn
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.13 no.5
    • /
    • pp.875-885
    • /
    • 2010
  • Recently, the role of Ubiquitous Sensor Network(USN) has been considered to be essential for supporting the near future Network Centric Warfare(NCW) and Tactical Information Communication Network(TICN). In this paper, we explore a set of data storage methods(external storage, local storage and data storage) and query processing methods in WSN. In particular, we focus on analyzing a novel data structure for supporting the local storage method, named the partial ordered tree(POT). The main idea behind POT is that sensor readings are usually correlated with the physical spatial domain. With the help of POT, only a small portion of sensor nodes participate in query processing tasks, and thus network lifetime is greatly increased. Through a series of simulation experiments, we demonstrate that the POT based local storage method clearly outperforms the existing data storage methods in terms of the energy-efficiency, which directly affects the network lifetime, for processing exact match queries, range queries and top-k queries.

Partial Image Retrieval Using an Efficient Pruning Method (효율적인 Pruning 기법을 이용한 부분 영상 검색)

  • 오석진;오상욱;김정림;문영식;설상훈
    • Journal of Broadcast Engineering
    • /
    • v.7 no.2
    • /
    • pp.145-152
    • /
    • 2002
  • As the number of digital images available to users is exponentially growing due to the rapid development of digital technology, content-based image retrieval (CBIR) has been one of the most active research areas. A variety of image retrieval methods have been proposed, where, given an input query image, the images that are similar to the input are retrieved from an image database based on low-level features such as colors and textures. However, most of the existing retrieval methods did not consider the case when an input query image is a part of a whole image in the database due to the high complexity involved in partial matching. In this paper, we present an efficient method for partial image matching by using the histogram distribution relationships between query image and whole image. The proposed approach consists of two steps: the first step prunes the search space and the second step performs block-based retrieval using partial image matching to rank images in candidate set. The experimental results demonstrate the feasibility of the proposed algorithm after assuming that the response tune of the system is very high while retrieving only by using partial image matching without Pruning the search space.

Energy-efficient query processing based on partial attribute values in wireless sensor networks (무선 센서 네트워크에서 부분 속성값을 활용한 에너지 효율적인 질의처리)

  • Kim, Sung-Suk;Kim, Hyong-Soon;Yang, Sun-Ok
    • Journal of KIISE:Databases
    • /
    • v.37 no.3
    • /
    • pp.137-145
    • /
    • 2010
  • Wireless sensors play important roles in various areas as ubiquitous computing is generalized. Depending on applications properties, each sensor can be equipped with limited computing power in addition to general function of gathering environment-related information. One of main issues in this environment is to improve energy-efficiency in sensor nodes. In this paper, we devise a new attribute-query processing algorithm. Each sensor has to maintain partial information locally about attributes values gathered at its all descendent nodes. As the volume is higher, however, the maintenance cost also increases. And the update cost also has to be considered in the proposed algorithm. Thus, some bits, AVB(Attribute-Value Bits), are delivered instead of the value itself, where each bit represents a bound of attribute. Thus, the partial information can decrease the number of exchanged messages with a little cost during query processing. Through simulation works, the proposed algorithm is analyzed from several points of view.

Spatial Query Processing Based on Minimum Bounding in Wireless Sensor Networks

  • Yang, Sun-Ok;Kim, Sung-Suk
    • Journal of Information Processing Systems
    • /
    • v.5 no.4
    • /
    • pp.229-236
    • /
    • 2009
  • Sensors are deployed to gather physical, environmental data in sensor networks. Depending on scenarios, it is often assumed that it is difficult for batteries to be recharged or exchanged in sensors. Thus, sensors should be able to process users' queries in an energy-efficient manner. This paper proposes a spatial query processing scheme- Minimum Bounding Area Based Scheme. This scheme has a purpose to decrease the number of outgoing messages during query processing. To do that, each sensor has to maintain some partial information locally about the locations of descendent nodes. In the initial setup phase, the routing path is established. Each child node delivers to its parent node the location information including itself and all of its descendent nodes. A parent node has to maintain several minimum bounding boxes per child node. This scheme can reduce unnecessary message propagations for query processing. Finally, the experimental results show the effectiveness of the proposed scheme.

Energy Efficient Query Processing based on Multiple Query Optimization in Wireless Sensor Networks (무선 센서 네트워크에서 다중 질의 최적화 기법을 이용한 에너지 효율적인 질의 처리 기법)

  • Lee, Yu-Won;Chung, Eun-Ho;Haam, Deok-Min;Lee, Chung-Ho;Lee, Yong-Jun;Lee, Ki-Yong;Kim, Myoung-Ho
    • Journal of KIISE:Databases
    • /
    • v.36 no.1
    • /
    • pp.8-21
    • /
    • 2009
  • A wireless sensor network is a computer network which consists of spatially distributed devices, called sensor nodes. In wireless sensor networks, energy efficiency is a key issue since sensor nodes must resides upon limited energy. To retrieve sensor information without dealing with the network issues, a sensor network is treated as conceptual database on which query can be requested. When multiple queries are requested for processing in a wireless sensor network, energy consumption can be significantly reduced if common partial results among similar queries can be effectively shared. In this paper, we propose an energy efficient multi-query processing technique based on the coverage relationship between multiple queries. When a new query is requested, our proposed technique derives an equivalent query from queries running at the moment, if it is derivable. Our technique first computes the set of running queries that may derive a partial result of the new query and then test if this set covers all the result of the new query attribute-wise and tuple-wise. If the result of the new query can be derived from the results of executing queries, the new query derives its result at the base station instead of being executed in the sensor network.

Scope Minimization of Join Queries using a Range Window on Streaming XML Data (스트리밍 XML 데이타에서 영역 윈도우를 사용한 조인 질의의 범위 최소화 기법)

  • Park, Seog;Kim, Mi-Sun
    • Journal of KIISE:Databases
    • /
    • v.33 no.2
    • /
    • pp.224-238
    • /
    • 2006
  • As XML became the standard of data exchange in the internet, the needs for effective query processing for XML data in streaming environment is increasing. Applying the existing database technique which processes data with the unit of tuple to the streaming XML data causes the out-of-memory problem due to limited memory volume. Likewise the cost for searching query path and accessing specific data may be remarkably increased because of special structure of XML. In a word it is unreasonable to apply the existing database system to the streaming environment that processes query for partial data, not the whole one. Thus, it should be able to search partial streaming data that rapidly satisfies join predicate through using low-capacity memory, based on a store technique suitable to streaming XML data. In this thesis, in order to study the store technique for low-capacity memory, the PCDATA and the CDATA-related parts, which can be used as predicate on join query, were fetched and saved. In addition, in an attempt to compare rapid join predicates, the range window of streaming XML data was set with the object of selectively joining windows that satisfies the query, based on Cardinality * and + among the structure information of DTD.