Keyword search over relational tables and streams

Alexander Markowetz, Yin Yang, Dimitris Papadias

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

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.

Original languageEnglish
Article number17
JournalACM Transactions on Database Systems
Volume34
Issue number3
DOIs
Publication statusPublished - 1 Aug 2009
Externally publishedYes

Fingerprint

Query processing
Semantics
Experiments

Keywords

  • Data graph
  • Data streams
  • Query processing
  • Relational databases
  • Search

ASJC Scopus subject areas

  • Information Systems

Cite this

Keyword search over relational tables and streams. / Markowetz, Alexander; Yang, Yin; Papadias, Dimitris.

In: ACM Transactions on Database Systems, Vol. 34, No. 3, 17, 01.08.2009.

Research output: Contribution to journalArticle

Markowetz, Alexander ; Yang, Yin ; Papadias, Dimitris. / Keyword search over relational tables and streams. In: ACM Transactions on Database Systems. 2009 ; Vol. 34, No. 3.
@article{924423af611b4ee28fc9f29cee8b4be2,
title = "Keyword search over relational tables and streams",
abstract = "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.",
keywords = "Data graph, Data streams, Query processing, Relational databases, Search",
author = "Alexander Markowetz and Yin Yang and Dimitris Papadias",
year = "2009",
month = "8",
day = "1",
doi = "10.1145/1567274.1567279",
language = "English",
volume = "34",
journal = "ACM Transactions on Database Systems",
issn = "0362-5915",
publisher = "Association for Computing Machinery (ACM)",
number = "3",

}

TY - JOUR

T1 - Keyword search over relational tables and streams

AU - Markowetz, Alexander

AU - Yang, Yin

AU - Papadias, Dimitris

PY - 2009/8/1

Y1 - 2009/8/1

N2 - 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.

AB - 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.

KW - Data graph

KW - Data streams

KW - Query processing

KW - Relational databases

KW - Search

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

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

U2 - 10.1145/1567274.1567279

DO - 10.1145/1567274.1567279

M3 - Article

AN - SCOPUS:70349144021

VL - 34

JO - ACM Transactions on Database Systems

JF - ACM Transactions on Database Systems

SN - 0362-5915

IS - 3

M1 - 17

ER -