Keyword search on relational data streams

Alexander Markowetz, Yin Yang, Dimitris Papadias

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

62 Citations (Scopus)

Abstract

Increasing monitoring of transactions, environmental parameters, homeland security, RFID chips and interactions of online users rapidly establishes new data sources and application scenarios. In this paper, we propose keyword search on relational data streams (S-KWS) as an effective way for querying in such intricate and dynamic environments. Compared to conventional query methods, S-KWS has several benefits. First, it allows search for combinations of interesting terms without a-priori knowledge of the data streams in which they appear. Second, it hides the schema from the user and allows it to change, without the need for query re-writing. Finally, keyword queries are easy to express. Our contributions are summarized as follows. (i) We provide formal semantics for S-KWS, addressing the temporal validity and order of results. (ii) We propose an efficient algorithm for generating operator trees, applicable to arbitrary schemas. (iii) We integrate these trees into an operator mesh that shares common expressions. (iv) We develop techniques that utilize the operator mesh for efficient query processing. The techniques adapt dynamically to changes in the schema and input characteristics. Finally, (v) we present methods for purging expired tuples, minimizing either CPU, or memory requirements.

Original languageEnglish
Title of host publicationSIGMOD 2007: Proceedings of the ACM SIGMOD International Conference on Management of Data
Pages605-616
Number of pages12
DOIs
Publication statusPublished - 2007
Externally publishedYes
EventSIGMOD 2007: ACM SIGMOD International Conference on Management of Data - Beijing, China
Duration: 12 Jun 200714 Jun 2007

Other

OtherSIGMOD 2007: ACM SIGMOD International Conference on Management of Data
CountryChina
CityBeijing
Period12/6/0714/6/07

Fingerprint

Purging
National security
Trees (mathematics)
Query processing
Radio frequency identification (RFID)
Program processors
Mathematical operators
Semantics
Data storage equipment
Monitoring

Keywords

  • Data streams
  • Keyword search

ASJC Scopus subject areas

  • Software
  • Information Systems

Cite this

Markowetz, A., Yang, Y., & Papadias, D. (2007). Keyword search on relational data streams. In SIGMOD 2007: Proceedings of the ACM SIGMOD International Conference on Management of Data (pp. 605-616) https://doi.org/10.1145/1247480.1247548

Keyword search on relational data streams. / Markowetz, Alexander; Yang, Yin; Papadias, Dimitris.

SIGMOD 2007: Proceedings of the ACM SIGMOD International Conference on Management of Data. 2007. p. 605-616.

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

Markowetz, A, Yang, Y & Papadias, D 2007, Keyword search on relational data streams. in SIGMOD 2007: Proceedings of the ACM SIGMOD International Conference on Management of Data. pp. 605-616, SIGMOD 2007: ACM SIGMOD International Conference on Management of Data, Beijing, China, 12/6/07. https://doi.org/10.1145/1247480.1247548
Markowetz A, Yang Y, Papadias D. Keyword search on relational data streams. In SIGMOD 2007: Proceedings of the ACM SIGMOD International Conference on Management of Data. 2007. p. 605-616 https://doi.org/10.1145/1247480.1247548
Markowetz, Alexander ; Yang, Yin ; Papadias, Dimitris. / Keyword search on relational data streams. SIGMOD 2007: Proceedings of the ACM SIGMOD International Conference on Management of Data. 2007. pp. 605-616
@inproceedings{dd75e8da8d8b41269757fd005027733c,
title = "Keyword search on relational data streams",
abstract = "Increasing monitoring of transactions, environmental parameters, homeland security, RFID chips and interactions of online users rapidly establishes new data sources and application scenarios. In this paper, we propose keyword search on relational data streams (S-KWS) as an effective way for querying in such intricate and dynamic environments. Compared to conventional query methods, S-KWS has several benefits. First, it allows search for combinations of interesting terms without a-priori knowledge of the data streams in which they appear. Second, it hides the schema from the user and allows it to change, without the need for query re-writing. Finally, keyword queries are easy to express. Our contributions are summarized as follows. (i) We provide formal semantics for S-KWS, addressing the temporal validity and order of results. (ii) We propose an efficient algorithm for generating operator trees, applicable to arbitrary schemas. (iii) We integrate these trees into an operator mesh that shares common expressions. (iv) We develop techniques that utilize the operator mesh for efficient query processing. The techniques adapt dynamically to changes in the schema and input characteristics. Finally, (v) we present methods for purging expired tuples, minimizing either CPU, or memory requirements.",
keywords = "Data streams, Keyword search",
author = "Alexander Markowetz and Yin Yang and Dimitris Papadias",
year = "2007",
doi = "10.1145/1247480.1247548",
language = "English",
isbn = "1595936866",
pages = "605--616",
booktitle = "SIGMOD 2007: Proceedings of the ACM SIGMOD International Conference on Management of Data",

}

TY - GEN

T1 - Keyword search on relational data streams

AU - Markowetz, Alexander

AU - Yang, Yin

AU - Papadias, Dimitris

PY - 2007

Y1 - 2007

N2 - Increasing monitoring of transactions, environmental parameters, homeland security, RFID chips and interactions of online users rapidly establishes new data sources and application scenarios. In this paper, we propose keyword search on relational data streams (S-KWS) as an effective way for querying in such intricate and dynamic environments. Compared to conventional query methods, S-KWS has several benefits. First, it allows search for combinations of interesting terms without a-priori knowledge of the data streams in which they appear. Second, it hides the schema from the user and allows it to change, without the need for query re-writing. Finally, keyword queries are easy to express. Our contributions are summarized as follows. (i) We provide formal semantics for S-KWS, addressing the temporal validity and order of results. (ii) We propose an efficient algorithm for generating operator trees, applicable to arbitrary schemas. (iii) We integrate these trees into an operator mesh that shares common expressions. (iv) We develop techniques that utilize the operator mesh for efficient query processing. The techniques adapt dynamically to changes in the schema and input characteristics. Finally, (v) we present methods for purging expired tuples, minimizing either CPU, or memory requirements.

AB - Increasing monitoring of transactions, environmental parameters, homeland security, RFID chips and interactions of online users rapidly establishes new data sources and application scenarios. In this paper, we propose keyword search on relational data streams (S-KWS) as an effective way for querying in such intricate and dynamic environments. Compared to conventional query methods, S-KWS has several benefits. First, it allows search for combinations of interesting terms without a-priori knowledge of the data streams in which they appear. Second, it hides the schema from the user and allows it to change, without the need for query re-writing. Finally, keyword queries are easy to express. Our contributions are summarized as follows. (i) We provide formal semantics for S-KWS, addressing the temporal validity and order of results. (ii) We propose an efficient algorithm for generating operator trees, applicable to arbitrary schemas. (iii) We integrate these trees into an operator mesh that shares common expressions. (iv) We develop techniques that utilize the operator mesh for efficient query processing. The techniques adapt dynamically to changes in the schema and input characteristics. Finally, (v) we present methods for purging expired tuples, minimizing either CPU, or memory requirements.

KW - Data streams

KW - Keyword search

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

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

U2 - 10.1145/1247480.1247548

DO - 10.1145/1247480.1247548

M3 - Conference contribution

AN - SCOPUS:35448973772

SN - 1595936866

SN - 9781595936868

SP - 605

EP - 616

BT - SIGMOD 2007: Proceedings of the ACM SIGMOD International Conference on Management of Data

ER -