Keyword Search in Databases- P28 potx

134 BIBLIOGRAPHY Surajit Chaudhuri and Gautam Das. Keyword querying and ranking in databases. Proc. of the VLDB Endowment, 2(2):1658–1659, 2009. (document) Surajit Chaudhuri and Raghav Kaushik. Extending autocompletion to tolerate errors. In Proc. 2009 ACM SIGMOD Int. Conf. On Management of Data, pages 707–718, 2009. DOI: 10.1145/1559845.1559919 5.3.6 Surajit Chaudhuri,Raghu Ramakrishnan, and Gerhard Weikum. Integrating db and ir technologies: What is the sound of one hand clapping? In Proc. of CIDR’05, 2005. (document) Yi Chen, Wei Wang, Ziyang Liu, and Xuemin Lin. Keyword search on structured and semi- structured data. In Proc. 2009 ACM SIGMOD Int. Conf. On Management of Data, pages 1005– 1010, 2009. DOI: 10.1145/1559845.1559966 (document) Eric Chu, Akanksha Baid, Xiaoyong Chai, AnHai Doan, and Jeffrey F. Naughton. Combining keyword search and forms for ad hoc querying of databases. In Proc. 2009 ACM SIGMOD Int. Conf. On Management of Data, pages 349–360, 2009. DOI: 10.1145/1559845.1559883 5.3.4 Sara Cohen, Jonathan Mamou, Yaron Kanza, and Yehoshua Sagiv. XSEarch: A semantic search engine for XML. In Proc. 29th Int. Conf. on Very Large Data Bases, pages 45–56, 2003. 4.1.2, 4.5 Thomas H. Cormen, Clifford Stein, Ronald L. Rivest, and Charles E. Leiserson. Introduction to Algorithms. McGraw-Hill Higher Education, 2001. ISBN 0070131511. 3.2, 3.3.2 Bhavana Bharat Dalvi, Meghana Kshirsagar, and S. Sudarshan. Keyword search on ex- ternal memory data graphs. Proc. of the VLDB Endowment, 1(1):1189–1204, 2008. DOI: 10.1145/1453856.1453982 2.4, 3.4.3, 3.4.3 Tamraparni Dasu, Theodore Johnson, S. Muthukrishnan, and Vladislav Shkapenyuk. Mining database structure; or, how to build a data quality browser. In Proc. 2002 ACM SIGMOD Int. Conf. On Management of Data, pages 240–251, 2002. DOI: 10.1145/564691.564719 2 Bolin Ding, Jeffrey Xu Yu, Shan Wang, Lu Qin, Xiao Zhang, and Xuemin Lin. Finding top-k min- cost connected trees in databases. In Proc. 23rd Int. Conf. on Data Engineering, pages 836–845, 2007. DOI: 10.1109/ICDE.2007.367929 3.1, 3.4, 3.3.2, 3.3.2 S. E. Dreyfus and R. A. Wagner. The steiner problem in graphs. In Networks, 1972. 3.1 Ronald Fagin. Fuzzy queries in multimedia database systems. In Proc. 17th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, pages 1–10, 1998. DOI: 10.1145/275487.275488 3.5.1 Ronald Fagin, Amnon Lotem, and Moni Naor. Optimal aggregation algorithms for middleware. In Proc. 20th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, 2001. DOI: 10.1145/375551.375567 3.2, 4.4.1 BIBLIOGRAPHY 135 Ian De Felipe, Vagelis Hristidis, and Naphtali Rishe. Keyword search on spatial databases. In Proc. 24th Int. Conf. on Data Engineering, pages 656–665, 2008. DOI: 10.1109/ICDE.2008.4497474 5.2.1 Roy Goldman, Narayanan Shivakumar, Suresh Venkatasubramanian, and Hector Garcia-Molina. Proximity search in databases. In Proc. 24th Int. Conf. on Very Large Data Bases, pages 26–37, 1998. 5.3.6 Konstantin Golenberg,BennyKimelfeld,and YehoshuaSagiv. Keyword proximity search in complex data graphs. In Proc. 2008 ACM SIGMOD Int. Conf. On Management of Data, pages 927–940, 2008. DOI: 10.1145/1376616.1376708 3.1, 3.1, 3.2, 3.1, 3.3, 3.3.3, 3.3.3, 3.3.3, 3.3.3, 3.8, 3.10 Lin Guo, Jayavel Shanmugasundaram, and Golan Yona. Topology search over biologi- cal databases. In Proc. 23rd Int. Conf. on Data Engineering, pages 556–565, 2007. DOI: 10.1109/ICDE.2007.367901 5.3.6 Lin Guo, Feng Shao, Chavdar Botev, and Jayavel Shanmugasundaram. Xrank: Ranked keyword search over xml documents. In Proc. 2003 ACM SIGMOD Int. Conf. On Management of Data, pages 16–27, 2003. DOI: 10.1145/872757.872762 4.1.1, 4.2.2, 4.4.1, 4.4.1 Hao He, Haixun Wang, Jun Yang, and Philip S. Yu. BLINKS: ranked keyword searches on graphs. In Proc. 2007 ACM SIGMOD Int. Conf. On Management of Data, pages 305–316, 2007. DOI: 10.1145/1247480.1247516 2.4, 3.4.2, 3.4.2 Vagelis Hristidis, Luis Gravano, and Yannis Papakonstantinou. Efficient IR-Style keyword search over relational databases. In Proc. 29th Int. Conf. on Very Large Data Bases, pages 850–861, 2003a. 2.1, 2.3, 2.3.2 Vagelis Hristidis, Heasoo Hwang, and Yannis Papakonstantinou. Authority-based keyword search in databases. ACM Trans. Database Syst., 33(1), 2008. DOI: 10.1145/1331904.1331905 2.4, 5.3.1 Vagelis Hristidis, Nick Koudas, Yannis Papakonstantinou, and Divesh Srivastava. Keyword proximity search in xml trees. IEEE Trans. Knowl. and Data Eng., 18(4):525–539, 2006. DOI: 10.1109/TKDE.2006.1599390 4.5 Vagelis Hristidis and Yannis Papakonstantinou. DISCOVER: Keyword search in relational databases. In Proc. 28th Int. Conf. on Very Large Data Bases, pages 670–681, 2002. DOI: 10.1016/B978-155860869-6/50065-2 2.1, 2.2, 2.2, 2.3, 2.3.1 Vagelis Hristidis, Yannis Papakonstantinou, and Andrey Balmin. Keyword proximity search on xml graphs. In Proc. 19th Int. Conf. on Data Engineering, pages 367–378, 2003b. 4.5 Yu Huang, Ziyang Liu, and Yi Chen. extract: a snippet generation system for xml search. Proc. of the VLDB Endowment, 1(2):1392–1395, 2008a. 4.5 136 BIBLIOGRAPHY Yu Huang, Ziyang Liu, and Yi Chen. Query biased snippet generation in xml search. In Proc. 2008 ACM SIGMOD Int. Conf. On Management of Data, pages 315–326, 2008b. DOI: 10.1145/1376616.1376651 4.5 Ykä Huhtala, Juha Kärkkäinen, Pasi Porkka, and Hannu Toivonen. Tane: An efficient algorithm for discovering functional and approximate dependencies. Comput. J., 42(2):100–111, 1999. DOI: 10.1093/comjnl/42.2.100 1 Heasoo Hwang,Vagelis Hristidis, andYannisPapakonstantinou. Objectrank:asystem for authority- based search on databases. In Proc. 2006 ACM SIGMOD Int. Conf. On Management of Data, pages 796–798, 2006. DOI: 10.1145/1142473.1142593 5.3.1 H. V. Jagadish, Adriane Chapman, Aaron Elkiss, Magesh Jayapandian, Yunyao Li, Arnab Nandi, and Cong Yu. Making database systems usable. In Proc. 2007 ACM SIGMOD Int. Conf. On Management of Data, pages 13–24, 2007. DOI: 10.1145/1247480.1247483 5.3.6 Magesh Jayapandian and H. V. Jagadish. Automated creation of a forms-based database query interface. Proc. of the VLDB Endowment, 1(1):695–709, 2008. DOI: 10.1145/1453856.1453932 5.3.6 Shengyue Ji, Guoliang Li, Chen Li, and Jianhua Feng. Efficient interactive fuzzy keyword search. In Proc. 18th Int. World Wide Web Conf., pages 371–380, 2009. DOI: 10.1145/1526709.1526760 5.3.6 David S. Johnson, Christos H. Papadimitriou, and Mihalis Yannakakis. On generating all maximal independent sets. Inf. Process. Lett., 27(3), 1988. DOI: 10.1016/0020-0190(88)90065-8 3.2 Varun Kacholia, Shashank Pandit,Soumen Chakrabarti,S.Sudarshan,Rushi Desai, and Hrishikesh Karambelkar. Bidirectional expansion for keyword search on graph databases. In Proc. 31st Int. Conf. on Very Large Data Bases, pages 505–516, 2005. 3.4.1 Beeny Kimelfeld and Yehoshua Sagiv. New algorithms for computing steiner trees for a fixed number of terminals. In http://www.cs.huji.ac.il/ bennyk/papers/steiner06.pdf, 2006a. 3.3.2 Benny Kimelfeld and Yehoshua Sagiv. Finding and approximating top-k answers in keyword prox- imity search. In Proc. 25th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, pages 173–182, 2006b. DOI: 10.1145/1142351.1142377 3.1, 3.3, 3.3.3, 3.3.3, 3.5, 3.6, 3.3.3, 3.6, 3.7, 3.3.3, 3.8, 3.3.3, 3.9 Lingbo Kong,Rémi Gilleron,and Aurélien Lemay. Retrieving meaningful relaxedtightestfragments for xml keyword search. In Advances in Database Technology, Proc. 12th Int. Conf. on Extending Database Technology, pages 815–826, 2009. DOI: 10.1145/1516360.1516454 4.4.2, 4.4.2 BIBLIOGRAPHY 137 Georgia Koutrika, Alkis Simitsis, and Yannis E. Ioannidis. Précis: The essence of a query answer. In Proc. 22nd Int. Conf. on Data Engineering, pages 69–78, 2006. DOI: 10.1109/ICDE.2006.114 5.3.5 Georgia Koutrika, Zahra Mohammadi Zadeh, and Hector Garcia-Molina. Data clouds: summariz- ing keyword search results over structured data. In Advances in Database Technology, Proc. 12th Int. Conf. on Extending Database Technology, pages 391–402, 2009. DOI: 10.1145/1516360.1516406 5.3.3 Eugene L. Lawler. A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem. Management Science, 18(7), 1972. 3.2, 3.5.2 Guoliang Li, Jianhua Feng, Jianyong Wang, and Lizhu Zhou. Effective keyword search for valuable lcas over xml documents. In Proc. 16th ACM Conf. on Information and Knowledge Management, pages 31–40, 2007a. DOI: 10.1145/1321440.1321447 4.1.1, 4.5 Guoliang Li, Shengyue Ji, Chen Li, and Jianhua Feng. Efficient type-ahead search on relational data: a tastier approach. In Proc. 2009 ACM SIGMOD Int. Conf. On Management of Data, pages 695–706, 2009a. DOI: 10.1145/1559845.1559918 5.3.6 Guoliang Li, Beng Chin Ooi, Jianhua Feng, Jianyong Wang, and Lizhu Zhou. EASE: an effective 3-in-1 keyword search method for unstructured, semi-structured and structured data. In Proc. 2008 ACM SIGMOD Int. Conf. On Management of Data, pages 903–914, 2008a. 2.4, 3.1, 3.5.1, 3.5.1, 3.15, 3.5.1 Guoliang Li, Xiaofang Zhou, Jianhua Feng, and Jianyong Wang. Progressive keyword search in relational databases. In Proc. 25th Int. Conf. on Data Engineering, pages 1183–1186, 2009b. DOI: 10.1109/ICDE.2009.196 3.4.2 Wen-Syan Li, K. Selçuk Candan, Quoc Vu, and Divyakant Agrawal. Retrieving and organizing web pages by “information unit”. In Proc. 10th Int. World Wide Web Conf., pages 230–244, 2001. DOI: 10.1145/371920.372057 3.1 Yunyao Li, Ishan Chaudhuri, Huahai Yang, Satinder Singh, and H. V. Jagadish. Danalix: a domain- adaptive natural language interface for querying xml. In Proc. 2007 ACM SIGMOD Int. Conf. On Management of Data, pages 1165–1168, 2007b. DOI: 10.1145/1247480.1247643 4.5 Yunyao Li, Cong Yu, and H. V. Jagadish. Schema-free xquery. In Proc. 30th Int. Conf. on Very Large Data Bases, pages 72–83, 2004. 4.1.2, 4.5 Yunyao Li,CongYu,and H.V.Jagadish. Enabling schema-free xquery with meaningful query focus. VLDB J., 17(3):355–377, 2008b. DOI: 10.1007/s00778-006-0003-4 4.1.2, 4.5 138 BIBLIOGRAPHY Fang Liu,ClementT.Yu,Weiyi Meng,and Abdur Chowdhury.Effectivekeywordsearchinrelational databases. In Proc. 2006 ACM SIGMOD Int. Conf. On Management of Data, pages 563–574,2006. DOI: 10.1145/1142473.1142536 2.1, 2.1 Ziyang Liu and Yi Chen. Identifying meaningful return information for xml keyword search. In Proc. 2007 ACM SIGMOD Int. Conf. On Management of Data, pages 329–340, 2007. DOI: 10.1145/1247480.1247518 4.3, 4.3.1 Ziyang Liu and Yi Chen. Answering keyword queries on xml using materialized views. In Proc. 24th Int. Conf.on Data Engineering, pages 1501–1503,2008a.DOI: 10.1109/ICDE.2008.4497603 4.5 Ziyang Liu and Yi Chen. Reasoning and identifying relevant matches for xml keyword search. Proc. of the VLDB Endowment, 1(1):921–932, 2008b. DOI: 10.1145/1453856.1453956 4.3, 4.5, 4.3.2, 4.8, 4.3.2, 4.3.2, 4.33, 4.4.2, 4.4.2 Ziyang Liu, Peng Sun, and Yi Chen. Structured search result differentiation. Proc. of the VLDB Endowment, 2(1):313–324, 2009a. 4.5 Ziyang Liu,Peng Sun,Yu Huang,Yichuan Cai,andYi Chen. Challenges,techniques and directions in building xseek: an xml search engine. IEEE Data Eng. Bull., 32(2):36–43, 2009b. 4.3.1 Ziyang Liu, Jeffrey Walker, and Yi Chen. Xseek: A semantic xml search engine using keywords. In Proc. 33rd Int. Conf. on Very Large Data Bases, pages 1330–1333, 2007. 4.3.1 Yi Luo, Xuemin Lin, Wei Wang, and Xiaofang Zhou. Spark: top-k keyword query in relational databases. In Proc. 2007 ACM SIGMOD Int. Conf. On Management of Data, pages 115–126,2007. DOI: 10.1145/1247480.1247495 2.1, 2.1, 2.1, 2.1, 1, 2.3, 2.3.2, 2.3.2 Alexander Markowetz, Yin Yang, and Dimitris Papadias. Keyword search on relational data streams. In Proc. 2007 ACM SIGMOD Int. Conf. On Management of Data, pages 605–616, 2007. DOI: 10.1145/1247480.1247548 2.2, 2.2, 2.2, 2.2, 2.3 Sergey Melnik, Hector Garcia-Molina, and Erhard Rahm. Similarity flooding: A versatile graph matching algorithm and its application to schema matching. In Proc. 18th Int. Conf. on Data Engineering, pages 117–128, 2002. DOI: 10.1109/ICDE.2002.994702 4 Arnab Nandi and H. V. Jagadish. Qunits: queried units in database search. In P roc. 4th Biennial Conf. on Innovative Data Systems Research, 2009. 5.3.6 Ken Q. Pu and Xiaohui Yu. Keyword query cleaning. Proc. of the VLDB Endowment, 1(1):909–920, 2008. DOI: 10.1145/1453856.1453955 5.3.6 Ken Q. Pu and Xiaohui Yu. Frisk: Keyword query cleaning and processing in action. In Proc. 25th Int. Conf. on Data Engineering, pages 1531–1534, 2009. DOI: 10.1109/ICDE.2009.139 5.3.6 . Ding, Jeffrey Xu Yu, Shan Wang, Lu Qin, Xiao Zhang, and Xuemin Lin. Finding top-k min- cost connected trees in databases. In Proc. 23rd Int. Conf. on Data Engineering, pages 836–845, 2007. DOI: 10.1109/ICDE.2007.367929. terminals. In http://www.cs.huji.ac.il/ bennyk/papers/steiner06.pdf, 2006a. 3.3.2 Benny Kimelfeld and Yehoshua Sagiv. Finding and approximating top-k answers in keyword prox- imity search. In. Garcia-Molina. Proximity search in databases. In Proc. 24th Int. Conf. on Very Large Data Bases, pages 26–37, 1998. 5.3.6 Konstantin Golenberg,BennyKimelfeld,and YehoshuaSagiv. Keyword proximity search