Ten thousand sqls: Parallel keyword queries computing

Proceedings of the VLDB Endowment

Volumn 3, Issue 1, 2010, Pages 58-69

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

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER ARCHITECTURE; COST ESTIMATING; COST REDUCTION; COSTS; NETWORK ARCHITECTURE; RISK PERCEPTION; SEARCH ENGINES; SOFTWARE ARCHITECTURE;

ACCUMULATED ERRORS; CANDIDATE NETWORK; COST ESTIMATIONS; INTERMEDIATE RESULTS; MULTICORE ARCHITECTURES; OPERATION-LEVEL PARALLELISM; PERFORMANCE STUDY; RELATIONAL DATABASE;

QUERY PROCESSING;

EID: 79957818621     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1920841.1920854     Document Type: Article

References (34)

1. S. Agrawal, S. Chaudhuri, and G. Das. DBXplorer: A system for keyword-based search over relational databases. In Proc. of ICDE'02, 2002.
2. A. Balmin, V. Hristidis, and Y. Papakonstantinou. ObjectRank: Authority-based keyword search in databases. In Proc. of VLDB'04, 2004.
3. 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.
4. D. Bozdag, F. Özgüner, and Ü. V. Çatalyürek. Compaction of schedules and a two-stage approach for duplication-based dag scheduling. IEEE Trans. Parallel Distrib. Syst., 20(6):857-871, 2009.
5. S. Chaudhuri. An overview of query optimization in relational systems. In Proc. of PODS'98, 1998.
6. B. B. Dalvi, M. Kshirsagar, and S. Sudarshan. Keyword search on external memory data graphs. PVLDB, 1(1), 2008.
7. 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.
8. S. E. Dreyfus and R. A. Wagner. The steiner problem in graphs. In Networks, 1972.
9. K. Golenberg, B. Kimelfeld, and Y. Sagiv. Keyword proximity search in complex data graphs. In Proc. of SIGMOD'08, 2008.
10. G. Graefe. Query evaluation techniques for large databases. ACM Comput. Surv., 25(2), 1993.
11. H. He, H. Wang, J. Yang, and P. S. Yu. BLINKS: ranked keyword searches on graphs. In Proc. of SIGMOD'07, 2007.
12. V. Hristidis, L. Gravano, and Y. Papakonstantinou. Efficient IR-Style keyword search over relational databases. In Proc. of VLDB'03, 2003.
13. V. Hristidis, H. Hwang, and Y. Papakonstantinou. Authority-based keyword search in databases. ACM Trans. Database Syst., 33(1), 2008.
14. V. Hristidis and Y. Papakonstantinou. DISCOVER: Keyword search in relational databases. In Proc. of VLDB'02, 2002.
15. 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.
16. A. Kementsietsidis, F. Neven, D. V. de Craen, and S. Vansummeren. Scalable multi-query optimization for exploratory queries over federated scientific databases. PVLDB, 1(1), 2008.
17. B. Kimelfeld and Y. Sagiv. Finding and approximating top-k answers in keyword proximity search. In Proc. of PODS'06, 2006.
18. G. Li, B. C. Ooi, J. Feng, J. Wang, and L. Zhou. EASE: an effective 3-in-1 keyword search method for unstructured, semi-structured and structured data. In Proc. of SIGMOD'08, 2008.
19. F. Liu, C. T. Yu, W. Meng, and A. Chowdhury. Effective keyword search in relational databases. In Proc. of SIGMOD'06, 2006.
20. H. Lu. Query Processing in Parallel Relational Database Systems. IEEE Computer Society Press, Los Alamitos, CA, USA, 1994.
21. Y. Luo, X. Lin, W. Wang, and X. Zhou. Spark: top-k keyword query in relational databases. In Proc. of SIGMOD'07, 2007.
22. A. Markowetz, Y. Yang, and D. Papadias. Keyword search on relational data streams. In Proc. of SIGMOD'07, 2007.
23. P. Mishra and M. H. Eich. Join processing in relational databases. ACM Comput. Surv., 24(1), 1992.
24. S. Park, T. Kim, J. Park, J. Kim, and H. Im. Parallel skyline computation on multicore architectures. In Proc. of ICDE'09, pages 760-771, 2009.
25. L. Qin, J. X. Yu, and L. Chang. Keyword search in databases: The power of rdbms. In Proc. of SIGMOD'09, 2009.
26. L. Qin, J. X. Yu, L. Chang, and Y. Tao. Querying communities in relational databases. In Proc. of ICDE'09, 2009.
27. L. Qin, J. X. Yu, L. Chang, and Y. Tao. Scalable keyword search on large data streams. In Proc. of ICDE'09, 2009.
28. P. Roy, S. Seshadri, S. Sudarshan, and S. Bhobe. Efficient and extensible algorithms for multi query optimization. In Proc. of SIGMOD'00, 2000.
29. S. Tatikonda and S. Parthasarathy. Mining tree-structured data on multicore systems. PVLDB, 2(1):694-705, 2009.
30. C.-H. Yang, P. Lee, and Y.-C. Chung. Improving static task scheduling in heterogeneous and homogeneous computing systems. In Proc. of ICPP'07, 2007.
31. C. Yu and W. Meng. Principles of Database Query Processing for Advanced Applications. Morgan Kaufmann, 1998.
32. J. X. Yu, L. Qin, and L. Chang. Keyword Search in Databases. Morgan and Claypool Publishers, 2010.
33. P. S. Yu, M. Syan Chen, J. L. Wolf, and J. Turek. Parallel query processing. ACM Computing Surveys, 16:399-433, 1993.
34. J. Zhou, P.-A. Larson, J. C. Freytag, and W. Lehner. Efficient exploitation of similar subexpressions for query processing. In Proc. of SIGMOD'07, 2007.