Scalable keyword search on large data streams

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2009, Pages 1199-1202

  Qin, Lu ^a   Yu, Jeffrey Xu ^a   Chang, Lijun ^a   Tao, Yufei ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STREAM; DATABASE SCHEMA; HIGH EFFICIENCY; HIGH QUALITY SERVICE; HIGH-SPEED DATA; INTERMEDIATE RESULTS; KEYWORD QUERIES; KEYWORD SEARCH; LARGE DATA; RELATIONAL DATA STREAMS; SCHEMA GRAPH;

GRAPH THEORY; INFORMATION SERVICES;

DATA COMMUNICATION SYSTEMS;

EID: 67649643432     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2009.200     Document Type: Conference Paper

References (18)

1. A. Markowetz, Y. Yang, and D. Papadias, "Keyword search on relational data streams," in Proc. of SIGMOD'07, 2007.
2. P. A. Bernstein and D.-M. W. Chiu, "Using semi-joins to solve relational queries," J. ACM, vol. 28, no. 1, 1981.
3. V. Hristidis and Y. Papakonstantinou, "Discover: Keyword search in relational databases," in Proc. of VLDB'02, 2002.
4. J. Krämer and B. Seeger, "Pipes - a public infrastructure for processing and exploring streams," in Proc. of SIGMOD'04, 2004.
5. S. Agrawal, S. Chaudhuri, and G. Das, "Dbxplorer: A system for keyword-based search over relational databases," in Proc. of ICDE'02, 2002.
6. N. L. Sarda and A. Jain, "Mragyati : A system for keyword-based searching in databases," CoRR, vol. cs.DB/0110052, 2001.
7. Y. Luo, X. Lin, W. Wang, and X. Zhou, "Spark: top-k keyword query in relational databases," in Proc. of SIGMOD'07, 2007.
8. M. Sayyadian, H. LeKhac, A. Doan, and L. Gravano, "Efficient keyword search across heterogeneous relational databases," in Proc. of ICDE'07, 2007.
9. G. Bhalotia, A. Hulgeri, C. Nakhe, S. Chakrabarti, and S. Sudarshan, "Keyword searching and browsing in databases using banks," in Proc. of ICDE'02, 2002.
10. V. Kacholia, S. Pandit, S. Chakrabarti, S. Sudarshan, R. Desai, and H. Karambelkar, "Bidirectional expansion for keyword search on graph databases," in Proc. of VLDB'05, 2005.
11. B. Ding, J. X. Yu, S. Wang, L. Qin, X. Zhang, and X. Lin, "Finding top-k min-cost connected trees in databases," in Proc. of ICDE'07, 2007.
12. B. Kimelfeld and Y. Sagiv, "Finding and approximating top-k answers in keyword proximity search," in Proc. of PODS'06, 2006.
13. H. He, H. Wang, J. Yang, and P. S. Yu, "Blinks: ranked keyword searches on graphs," in Proc. of SIGMOD'07, 2007.
14. V. Hristidis, L. Gravano, and Y. Papakonstantinou, "Efficient ir-style keyword search over relational databases," in Proc. of VLDB'03, 2003.
15. F. Liu, C. T. Yu, W. Meng, and A. Chowdhury, "Effective keyword search in relational databases," in Proc. of SIGMOD'06, 2006.
16. T. W. Yan and H. Garcia-Molina, "The sift information dissemination system," ACM Trans. Database Syst., vol. 24, no. 4, 1999.
17. F. Fabret, H.-A. Jacobsen, F. Llirbat, J. Pereira, K. A. Ross, and D. Shasha, "Filtering algorithms and implementation for very fast publish/subscribe," in Proc. of SIGMOD'01, 2001.
18. V. Hristidis, O. Valdivia, M. Vlachos, and P. S. Yu, "Continuous keyword search on multiple text streams," in Proc. of CIKM'06, 2006.