• Title/Summary/Keyword: Query Type

Search Result 166, Processing Time 0.037 seconds

Study on Query Type and Data Structure for Mobile Meteorological Services

  • Choi, Jin-Oh
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.4
    • /
    • pp.457-460
    • /
    • 2011
  • For the mobile meteorological services, sensed data should be gathered at a server from various clients like as Ubiquitous Sensor Network, mobile phone or public traffic vehicle by wireless network. The gathered data at server have huge volume and increase continuously. Therefore, a special query method and data structure should be considered. This paper studies on all possible query type on the data and processing steps for the mobile meteorological services. Some query spaces will be discussed. After that, this paper proposes effective data structure for the sensed data to support the query types.

A Tuning Algorithm for the Multidimensional Type Inheritance Index of XML Databases (XML 데이터베이스 다차원 타입상속 색인구조의 조율 알고리즘)

  • Lee, Jong-Hak
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.2
    • /
    • pp.269-281
    • /
    • 2011
  • For the MD-TIX(multidimensional type inheritance index) that supports query processing for the type inheritance concept in XML databases, this paper presents an index tuning algorithm that enhances the performance of the XML query processing according to the query pattern. The MD-TIX uses a multidimensional index structure to support complex XML queries involving both nested elements and type inheritance hierarchies. In this index tuning algorithm, we first determine a shape of index page regions by using the query information about the user's query pattern, and then construct an optimal MD-TIX by applying a region splitting strategy that makes the shape of the page regions into the predetermined one. The performance evaluation results indicate that the proposed tuning algorithm builds an optimal MD-TIX by a given query pattern, and in the case of the three-dimensional query regions for the nested predicates of path length 2, the performance is much enhanced according to the skewed degree of the query region's shape.

A Query Expansion Technique using Query Patterns in QA systems (QA 시스템에서 질의 패턴을 이용한 질의 확장 기법)

  • Kim, Hea-Jung;Bu, Ki-Dong
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.12 no.1
    • /
    • pp.1-8
    • /
    • 2007
  • When confronted with a query, question answering systems endeavor to extract the most exact answers possible by determining the answer type that fits with the key terms used in the query. However, the efficacy of such systems is limited by the fact that the terms used in a query may be in a syntactic form different to that of the same words in a document. In this paper, we present an efficient semantic query expansion methodology based on query patterns in a question category concept list comprised of terms that are semantically close to terms used in a query. The proposed system first constructs a concept list for each question type and then builds the concept list for each question category using a learning algorithm. The results of the present experiments suggest the promise of the proposed method.

  • PDF

Consideration of a Robust Search Methodology that could be used in Full-Text Information Retrieval Systems (퍼지 논리를 이용한 사용자 중심적인 Full-Text 검색방법에 관한 연구)

  • Lee, Won-Bu
    • Asia pacific journal of information systems
    • /
    • v.1 no.1
    • /
    • pp.87-101
    • /
    • 1991
  • The primary purpose of this study was to investigate a robust search methodology that could be used in full-text information retrieval systems. A robust search methodology is one that can be easily used by a variety of users (particularly naive users) and it will give them comparable search performance regardless of their different expertise or interests In order to develop a possibly robust search methodology, a fully functional prototype of a fuzzy knowledge based information retrieval system was developed. Also, an experiment that used this prototype information retreival system was designed to investigate the performance of that search methodology over a small exploratory sample of user queries To probe the relatonships between the possibly robust search performance and the query organization using fuzzy inference logic, the search performance of a shallow query structure was analyzes. Consequently the following several noteworthy findings were obtained: 1) the hierachical(tree type) query structure might be a better query organization than the linear type query structure 2) comparing with the complex tree query structure, the simple tree query structure that has at most three levels of query might provide better search performance 3) the fuzzy search methodology that employs a proper levels of cut-off value might provide more efficient search performance than the boolean search methodology. Even though findings could not be statistically verified because the experiments were done using a single replication, it is worth noting however, that the research findings provided valuable information for developing a possibly robust search methodology in full-text information retrieval.

  • PDF

Design of Spatial Query Language for GEO Millennium Server TM

  • Zhaohong Liu;Kim, Sung-Hee;Oh, Young-Hwan;Bae, Hae-young
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2000.10a
    • /
    • pp.113-115
    • /
    • 2000
  • A GIS software GEO Millennium SystemTM has been developed to integrated with spatial database that combines conventional and spatially related data. As we known well the standard query language lacks the support of spatial data type and predicate, and can not serve as the query language in the spatial database directly; some extended strategies have been proposed, but some of them need their own storage manager, some introfuce new clause into the SELECT-FROM-WHERE structure, and some is very complex and available to us. So we designed our own query language on the conventional storage manager system. It supports the Spatial Data Type and predicate, and provides the full query capabilities of SQL on the non-spatial part of the database while being tightly integrated with the spatial part, without changing the standard SQL structure.

  • PDF

Spatio-temporal Sensor Data Processing Techniques

  • Kim, Jeong-Joon
    • Journal of Information Processing Systems
    • /
    • v.13 no.5
    • /
    • pp.1259-1276
    • /
    • 2017
  • As technologies related to sensor network are currently emerging and the use of GeoSensor is increasing along with the development of Internet of Things (IoT) technology, spatial query processing systems to efficiently process spatial sensor data are being actively studied. However, existing spatial query processing systems do not support a spatial-temporal data type and a spatial-temporal operator for processing spatialtemporal 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. Lastly, this paper verified the utility of System through a scenario, and proved that this system's performance is better than existing systems through performance assessment of performance time and memory usage.

Query Processing of Spatio-temporal Trajectory for Moving Objects (이동 객체를 위한 시공간 궤적의 질의 처리)

  • Byoungwoo Oh
    • Journal of Platform Technology
    • /
    • v.11 no.1
    • /
    • pp.52-59
    • /
    • 2023
  • The importance of spatio-temporal trajectories for contact tracing has increased due to the recent COVID-19 pandemic. Spatio-temporal trajectories store time and spatial data of moving objects. In this paper, I propose query processing for spatio-temporal trajectories of moving objects. The spatio-temporal trajectory model of moving objects has point type spatial data for storing locations and timestamp type temporal data for time. A trajectory query is a query to search for pairs of users who have been in close contact by boarding the same bus. To process the trajectory query, I use the Geolife dataset provided by Microsoft. The proposed trajectory query processing method divides trajectory data by date and checks whether users' trajectories were nearby for each date to generate information about contacts as the result.

  • PDF

Improving the Performance of Web Search using Query Types (질의유형에 기반한 웹 검색의 성능 향상)

  • Kang, In-Ho;An, Dong-Un
    • The KIPS Transactions:PartB
    • /
    • v.11B no.5
    • /
    • pp.537-544
    • /
    • 2004
  • The Web is rich with various sources of information. Due to the massive and heterogeneous web document collections, users want to find various types of target pages. Each type of information for Web search has designated queries. If a user query is not a designated query, then we cannot have good result documents. Different strategies are needed to utilize the goodness of each type of information for a search engine. If we know the property of information, then we can refine candidate pages and rank them delicately. Various experiments are conducted to show the properties of each type of information. Therefore, we show an appropriate combining formula to utilize the properties of each type of information. In addition, for a service finding task, we propose Service Link Information that utilizes the existence of mechanisms for a user interaction.

Automatic Suggestion for PubMed Query Reformulation

  • Tuan, Luu Anh;Kim, Jung-Jae
    • Journal of Computing Science and Engineering
    • /
    • v.6 no.2
    • /
    • pp.161-167
    • /
    • 2012
  • Query reformulation is an interactive process of revising user queries according to the query results. To assist biomedical researchers in this process, we present novel methods for automatically generating query reformulation suggestions. While previous work on query reformulation focused on addition of words to user queries, our method can deal with three types of query reformulation (i.e., addition, removal and replacement). The accuracy of the method for the addition type is ten times better than PubMed's "Also try", while the execution time is short enough for practical use.

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

  • Kim, Jeong-Joon;Chung, Sung-Taek
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.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.