• 제목/요약/키워드: Multiple Query

검색결과 254건 처리시간 0.035초

An efficient Component Retrieval Scheme for multiple facet values and multiple facets (다중 패싯값과 다중 패싯을 위한 컴포넌트의 효율적인 검색 방법)

  • 금영욱
    • Journal of the Korea Society of Computer and Information
    • /
    • 제7권3호
    • /
    • pp.16-22
    • /
    • 2002
  • Effective component retrieval is very essential for component based software development. Facet scheme is one of typical component retrieval methods and is being widely researched. In this paper, an efficient algorithm which supports a query with logical operator NOT for more than one facet values is presented. With this new algorithm the complexity to calculate a weighted synaptic connectivity matrix is enhanced. Also a new scheme is presented to support a query with logical operators for multiple facets.

  • PDF

MMJoin: An Optimization Technique for Multiple Continuous MJoins over Data Streams (데이타 스트림 상에서 다중 연속 복수 조인 질의 처리 최적화 기법)

  • Byun, Chang-Woo;Lee, Hun-Zu;Park, Seog
    • Journal of KIISE:Databases
    • /
    • 제35권1호
    • /
    • pp.1-16
    • /
    • 2008
  • Join queries having heavy cost are necessary to Data Stream Management System in Sensor Network where plural short information is generated. It is reasonable that each join operator has a sliding-window constraint for preventing DISK I/O because the data stream represents the infinite size of data. In addition, the join operator should be able to take multiple inputs for overall results. It is possible for the MJoin operator with sliding-windows to do so. In this paper, we consider the data stream environment where multiple MJoin operators are registered and propose MMJoin which deals with issues of building and processing a globally shared query considering characteristics of the MJoin operator with sliding-windows. First, we propose a solution of building the global shared query execution plan. Second, we solved the problems of updating a window size and routing for a join result. Our study can be utilized as a fundamental research for an optimization technique for multiple continuous joins in the data stream environment.

Multi-core-based Parallel Query of 3D Point Cloud Indexed in Octree (옥트리로 색인한 3차원 포인트 클라우드의 다중코어 기반 병렬 탐색)

  • Han, Soohee
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • 제31권4호
    • /
    • pp.301-310
    • /
    • 2013
  • The aim of the present study is to enhance query speed of large 3D point cloud indexed in octree by parallel query using multi-cores. Especially, it is focused on developing methods of accessing multiple leaf nodes in octree concurrently to query points residing within a radius from a given coordinates. To the end, two parallel query methods are suggested using different strategies to distribute query overheads to each core: one using automatic division of 'for routines' in codes controlled by OpenMP and the other considering spatial division. Approximately 18 million 3D points gathered by a terrestrial laser scanner are indexed in octree and tested in a system with a 8-core CPU to evaluate the performances of a non-parallel and the two parallel methods. In results, the performances of the two parallel methods exceeded non-parallel one by several times and the two parallel rivals showed competing aspects confronting various query radii. Parallel query is expected to be accelerated by anticipated improvements of distribution strategies of query overhead to each core.

SPARQL Query Automatic Transformation Method based on Keyword History Ontology for Semantic Information Retrieval

  • Jo, Dae Woong;Kim, Myung Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • 제22권2호
    • /
    • pp.97-104
    • /
    • 2017
  • In semantic information retrieval, we first need to build domain ontology and second, we need to convert the users' search keywords into a standard query such as SPARQL. In this paper, we propose a method that can automatically convert the users' search keywords into the SPARQL queries. Furthermore, our method can ensure effective performance in a specific domain such as law. Our method constructs the keyword history ontology by associating each keyword with a series of information when there are multiple keywords. The constructed ontology will convert keyword history ontology into SPARQL query. The automatic transformation method of SPARQL query proposed in the paper is converted into the query statement that is deemed the most appropriate by the user's intended keywords. Our study is based on the existing legal ontology constructions that supplement and reconstruct schema and use it as experiment. In addition, design and implementation of a semantic search tool based on legal domain and conduct experiments. Based on the method proposed in this paper, the semantic information retrieval based on the keyword is made possible in a legal domain. And, such a method can be applied to the other domains.

Spatio-Temporal Query Processing Over Sensor Networks: Challenges, State Of The Art And Future Directions

  • Jabeen, Farhana;Nawaz, Sarfraz;Tanveer, Sadaf;Iqbal, Majid
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제6권7호
    • /
    • pp.1756-1776
    • /
    • 2012
  • Wireless sensor networks (WSNs) are likely to be more prevalent as their cost-effectiveness improves. The spectrum of applications for WSNs spans multiple domains. In environmental sciences, in particular, they are on the way to become an essential technology for monitoring the natural environment and the dynamic behavior of transient physical phenomena over space. Existing sensor network query processors (SNQPs) have also demonstrated that in-network processing is an effective and efficient means of interaction with WSNs for performing queries over live data. Inspired by these findings, this paper investigates the question as to whether spatio-temporal and historical analysis can be carried over WSNs using distributed query-processing techniques. The emphasis of this work is on the spatial, temporal and historical aspects of sensed data, which are not adequately addressed in existing SNQPs. This paper surveys the novel approaches of storing the data and execution of spatio-temporal and historical queries. We introduce the challenges and opportunities of research in the field of in-network storage and in-network spatio-temporal query processing as well as illustrate the current status of research in this field. We also present new areas where the spatio-temporal and historical query processing can be of significant importance.

Query Processing Systems in Sensor Networks (센서 네트워크에서 질의 처리 시스템)

  • Kim, Jeong-Joon;Chung, Sung-Taek
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • 제17권4호
    • /
    • pp.137-142
    • /
    • 2017
  • Recently, along with the development of IoT technology, technologies for wirelessly sensing various data, such as sensor nodes, RFID, CCTV, smart phones, etc., have rapidly developed, and in the field of multiple applications, to utilize sensor network related technology Have been actively pursued in various fields. Therefore, as GeoSensor utilization increases, query processing systems for efficiently processing 2D data such as spatial sensor data are actively researched. However, existing spatial query processing systems do not support a spatial-temporal data type and a spatial-temporal operator for processing spatial-temporal sensor data. Therefore, they are inadequate for processing spatial-temporal sensor data like GeoSensor. Accordingly, this paper developed a spatial-temporal query processing system, for efficient spatial-temporal query processing of spatial-temporal sensor data in a sensor network.

Efficient Processing of an Aggregate Query Stream in MapReduce (맵리듀스에서 집계 질의 스트림의 효율적인 처리 기법)

  • Choi, Hyunjean;Lee, Ki Yong
    • KIPS Transactions on Software and Data Engineering
    • /
    • 제3권2호
    • /
    • pp.73-80
    • /
    • 2014
  • MapReduce is a widely used programming model for analyzing and processing Big data. Aggregate queries are one of the most common types of queries used for analyzing Big data. In this paper, we propose an efficient method for processing an aggregate query stream, where many concurrent users continuously issue different aggregate queries on the same data. Instead of processing each aggregate query separately, the proposed method processes multiple aggregate queries together in a batch by a single, optimized MapReduce job. As a result, the number of queries processed per unit time increases significantly. Through various experiments, we show that the proposed method improves the performance significantly compared to a naive method.

A Scheme for Guaranteeing Fair Identification Delay in Gen-2 RFID Systems

  • Lim, In-Taek
    • Journal of information and communication convergence engineering
    • /
    • 제9권1호
    • /
    • pp.44-49
    • /
    • 2011
  • In RFID System, when multiple tags respond simultaneously, a collision can occur. A method that solves this collision is referred to anti-collision algorithm. In Gen-2 RFID system, if the slot-count size varies during a query round due to the collisions, a new query round begins with a QueryAdjust command. Anti-collision algorithm of Gen-2 RFID system is simple. But, it has the tag starvation problem that a tag may never be successfully identified because its responses always collide with others. Therefore, this paper proposes a scheme to guarantee the fair identification delay. In the proposed scheme, if the slot-count value changes due to the collisions, the reader broadcasts a CollisionRound command to begin a collision round. During the collision round, the reader identifies only tags that occurred collision during the previous query round.

An Enhanced Searching Algorithm over Unstructured Mobile P2P Overlay Networks

  • Shah, Babar;Kim, Ki-Il
    • Journal of information and communication convergence engineering
    • /
    • 제11권3호
    • /
    • pp.173-178
    • /
    • 2013
  • To discover objects of interest in unstructured peer-to-peer networks, the peers rely on flooding query messages which create incredible network traffic. This article evaluates the performance of an unstructured Gnutella-like protocol over mobile ad-hoc networks and proposes modifications to improve its performance. This paper offers an enhanced mechanism for an unstructured Gnutella-like network with improved peer features to better meet the mobility requirement of ad-hoc networks. The proposed system introduces a novel caching optimization technique and enhanced ultrapeer selection scheme to make communication more efficient between peers and ultrapeers. The paper also describes an enhanced query mechanism for efficient searching by applying multiple walker random walks with a jump and replication technique. According to the simulation results, the proposed system yields better performance than Gnutella, XL-Gnutella, and random walk in terms of the query success rate, query response time, network load, and overhead.

An Efficient Peer to Peer Search Based on Multiple Spanning Trees (다중 스패닝 트리를 이용한 효율적인 피어 투 피어 검색 기법)

  • Park, Hong-Ki;Jang, Ju-Wook
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 한국정보처리학회 2004년도 춘계학술발표대회
    • /
    • pp.1541-1544
    • /
    • 2004
  • 안정적이고 확장성이 좋은 Peer to Peer 시스템에서의 컨텐츠 검색을 위하여 여러 알고리즘이 제안되었다. 그 예로 Chord[1]는 네트워크에 참여하는 각각의 노드에 컨텐츠의 위치 정보를 분배하는 방식을 사용하기 때문에 노드가 컨텐츠의 위치 정보를 다른 노드에 이양하지 않고 네트워크에서 벗어나는 경우 그 노드가 가진 정보가 손실되어 네트워크 확장성에 제한을 받았다. 그리고 Gnutella[2]는 네트워크에 전파되는 query 수가 노드 당 연결 수에 대하여 지수적으로 증가하기 때문에 대역폭을 낭비하는 경향이 있었다. 본 논문에서 제안한 방식은 원하는 컨텐츠를 찾고자 할 때 Broadcast를 사용하여 query를 전파하는 방법을 수정하여 query가 네트워크 토폴로지를 기반으로 만들어진 여러 개의 Spanning Tree를 따라서 Source Routing방식으로 전파되도록 하였다. 제안한 방식을 적용한 경우, 네트워크 토폴로지에 따라 컨텐츠를 찾기 위한 query의 수를 Broadcast 방식의 16% ~ 3%까지 줄일 수 있었다.

  • PDF