Keyword search over relational tables and streams
ACM Transactions on Database Systems · 2009-08 · 34 (3) · 1-51
DOI: 10.1145/1567274.1567279 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM Transactions on Database Systems, online erschienen am 03.09.2009. Verfasst von Alexander Markowetz und 2 weiteren Autor:innen. Die Arbeit wurde bisher 12-mal zitiert (Crossref) und nennt 40 Literaturangaben.
Abstract (Originalsprache)
Relational Keyword Search (R-KWS) provides an intuitive way to query relational data without requiring SQL, or knowledge of the underlying schema. In this article we describe a comprehensive framework for R-KWS covering snapshot queries on conventional tables and continuous queries on relational streams. Our contributions are summarized as follows: (i) We provide formal semantics, addressing the temporal validity and order of results, spanning uniformly over tables and streams; (ii) we investigate two general methodologies for query processing, graph based and operator based , that resolve several problems of previous approaches; and (iii) we develop a range of algorithms and optimizations covering both methodologies. We demonstrate the effectiveness of R-KWS, as well as the significant performance benefits of the proposed techniques, through extensive experiments with static and streaming datasets.
Zitieren
APA
Markowetz, A., Yang, Y., & Papadias, D. (2009). Keyword search over relational tables and streams. ACM Transactions on Database Systems, 34(3), 1-51. https://doi.org/10.1145/1567274.1567279
Vancouver
Markowetz A, Yang Y, Papadias D. Keyword search over relational tables and streams. ACM Transactions on Database Systems. 2009;34(3):1-51. doi:10.1145/1567274.1567279
BibTeX
@article{Markowetz2009,
author = {Markowetz, Alexander and Yang, Yin and Papadias, Dimitris},
title = {Keyword search over relational tables and streams},
journal = {ACM Transactions on Database Systems},
year = {2009},
volume = {34},
number = {3},
pages = {1--51},
doi = {10.1145/1567274.1567279}
}
EUVIMED