Reachability indexes for relational keyword search

Alexander Markowetz, Yin Yang, Dimitris Papadias

Research output: Chapter in Book/Report/Conference proceedingConference contribution

19 Citations (Scopus)

Abstract

Due to its considerable ease of use, relational keyword search (R-KWS) has become increasingly popular. Its simplicity, however, comes at the cost of intensive query processing. Specifically, R-KWS explores a vast search space, comprised of all possible combinations of keyword occurrences in any attribute of every table. Existing systems follow two general methodologies for query processing: (i) graph based, which traverses a materialized data graph, and (ii) operator based, which executes relational operator trees on an underlying DBMS. In both cases, computations are largely wasted on graph traversals or operator tree executions that fail to return results. Motivated by this observation, we introduce a comprehensive framework for reachability indexing that eliminates such fruitless operations. We describe a range of indexes that capture various types of join reachability. Extensive experiments demonstrate that the proposed techniques significantly improve performance, often by several orders of magnitude.

Original languageEnglish
Title of host publicationProceedings - 25th IEEE International Conference on Data Engineering, ICDE 2009
Pages1163-1166
Number of pages4
DOIs
Publication statusPublished - 2009
Externally publishedYes
Event25th IEEE International Conference on Data Engineering, ICDE 2009 - Shanghai, China
Duration: 29 Mar 20092 Apr 2009

Other

Other25th IEEE International Conference on Data Engineering, ICDE 2009
CountryChina
CityShanghai
Period29/3/092/4/09

Fingerprint

Query processing
Mathematical operators
Experiments

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Information Systems

Cite this

Markowetz, A., Yang, Y., & Papadias, D. (2009). Reachability indexes for relational keyword search. In Proceedings - 25th IEEE International Conference on Data Engineering, ICDE 2009 (pp. 1163-1166). [4812491] https://doi.org/10.1109/ICDE.2009.191

Reachability indexes for relational keyword search. / Markowetz, Alexander; Yang, Yin; Papadias, Dimitris.

Proceedings - 25th IEEE International Conference on Data Engineering, ICDE 2009. 2009. p. 1163-1166 4812491.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Markowetz, A, Yang, Y & Papadias, D 2009, Reachability indexes for relational keyword search. in Proceedings - 25th IEEE International Conference on Data Engineering, ICDE 2009., 4812491, pp. 1163-1166, 25th IEEE International Conference on Data Engineering, ICDE 2009, Shanghai, China, 29/3/09. https://doi.org/10.1109/ICDE.2009.191
Markowetz A, Yang Y, Papadias D. Reachability indexes for relational keyword search. In Proceedings - 25th IEEE International Conference on Data Engineering, ICDE 2009. 2009. p. 1163-1166. 4812491 https://doi.org/10.1109/ICDE.2009.191
Markowetz, Alexander ; Yang, Yin ; Papadias, Dimitris. / Reachability indexes for relational keyword search. Proceedings - 25th IEEE International Conference on Data Engineering, ICDE 2009. 2009. pp. 1163-1166
@inproceedings{248c283f79f741c188ff6480685ea42f,
title = "Reachability indexes for relational keyword search",
abstract = "Due to its considerable ease of use, relational keyword search (R-KWS) has become increasingly popular. Its simplicity, however, comes at the cost of intensive query processing. Specifically, R-KWS explores a vast search space, comprised of all possible combinations of keyword occurrences in any attribute of every table. Existing systems follow two general methodologies for query processing: (i) graph based, which traverses a materialized data graph, and (ii) operator based, which executes relational operator trees on an underlying DBMS. In both cases, computations are largely wasted on graph traversals or operator tree executions that fail to return results. Motivated by this observation, we introduce a comprehensive framework for reachability indexing that eliminates such fruitless operations. We describe a range of indexes that capture various types of join reachability. Extensive experiments demonstrate that the proposed techniques significantly improve performance, often by several orders of magnitude.",
author = "Alexander Markowetz and Yin Yang and Dimitris Papadias",
year = "2009",
doi = "10.1109/ICDE.2009.191",
language = "English",
isbn = "9780769535456",
pages = "1163--1166",
booktitle = "Proceedings - 25th IEEE International Conference on Data Engineering, ICDE 2009",

}

TY - GEN

T1 - Reachability indexes for relational keyword search

AU - Markowetz, Alexander

AU - Yang, Yin

AU - Papadias, Dimitris

PY - 2009

Y1 - 2009

N2 - Due to its considerable ease of use, relational keyword search (R-KWS) has become increasingly popular. Its simplicity, however, comes at the cost of intensive query processing. Specifically, R-KWS explores a vast search space, comprised of all possible combinations of keyword occurrences in any attribute of every table. Existing systems follow two general methodologies for query processing: (i) graph based, which traverses a materialized data graph, and (ii) operator based, which executes relational operator trees on an underlying DBMS. In both cases, computations are largely wasted on graph traversals or operator tree executions that fail to return results. Motivated by this observation, we introduce a comprehensive framework for reachability indexing that eliminates such fruitless operations. We describe a range of indexes that capture various types of join reachability. Extensive experiments demonstrate that the proposed techniques significantly improve performance, often by several orders of magnitude.

AB - Due to its considerable ease of use, relational keyword search (R-KWS) has become increasingly popular. Its simplicity, however, comes at the cost of intensive query processing. Specifically, R-KWS explores a vast search space, comprised of all possible combinations of keyword occurrences in any attribute of every table. Existing systems follow two general methodologies for query processing: (i) graph based, which traverses a materialized data graph, and (ii) operator based, which executes relational operator trees on an underlying DBMS. In both cases, computations are largely wasted on graph traversals or operator tree executions that fail to return results. Motivated by this observation, we introduce a comprehensive framework for reachability indexing that eliminates such fruitless operations. We describe a range of indexes that capture various types of join reachability. Extensive experiments demonstrate that the proposed techniques significantly improve performance, often by several orders of magnitude.

UR - http://www.scopus.com/inward/record.url?scp=67649643433&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=67649643433&partnerID=8YFLogxK

U2 - 10.1109/ICDE.2009.191

DO - 10.1109/ICDE.2009.191

M3 - Conference contribution

SN - 9780769535456

SP - 1163

EP - 1166

BT - Proceedings - 25th IEEE International Conference on Data Engineering, ICDE 2009

ER -