Structured data retrieval using cover density ranking

Proceedings of the 2nd International Workshop on Keyword Search on Structured Data, KEYS '10

Volumn , Issue , 2010, Pages

  Coffman, Joel ^a   Weaver, Alfred C ^a  

^a University of Virginia   (United States)

Author keywords

Keyword search; Structured cover density scoring

Indexed keywords

INFORMATION RETRIEVAL; QUERY PROCESSING;

AMOUNT OF INFORMATION; DATA DRIVEN; DATA RETRIEVAL; KEYWORD SEARCH; MICROBLOGGING; RANKING FUNCTIONS; RELATIONAL DATABASE; SOCIAL-NETWORKING; STRUCTURED COVER DENSITY SCORING; STRUCTURED DATA;

SEARCH ENGINES;

EID: 78650146307     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1868366.1868367     Document Type: Conference Paper

References (21)

1. M. K. Bergman. The Deep Web: Surfacing Hidden Value. The Journal of Electronic Publishing, 7, August 2001.
2. G. Bhalotia, A. Hulgeri, C. Nakhe, S. Chakrabarti, and S. Sudarshan. Keyword Searching and Browsing in Databases using BANKS. In ICDE '02, pages 431-440, February 2002.
3. C. L. A. Clarke, G. V. Cormack, and E. A. Tudhope. Relevance ranking for one to three term queries. Information Processing and Management, 36(2):291-311, 2000.
4. B. Ding, J. X. Yu, S. Wang, L. Qin, X. Zhang, and X. Lin. Finding Top-k Min-Cost Connected Trees in Databases. In ICDE '07, pages 836-845, April 2007.
5. K. Golenberg, B. Kimelfeld, and Y. Sagiv. Keyword Proximity Search in Complex Data Graphs. In SIGMOD '08, pages 927-940, June 2008.
6. H. He, H. Wang, J. Yang, and P. S. Yu. BLINKS: Ranked Keyword Searches on Graphs. In SIGMOD '07, pages 305-316, June 2007.
7. V. Hristidis, L. Gravano, and Y. Papakonstantinou. Efficient IR-style Keyword Search over Relational Databases. In VLDB '03, pages 850-861, September 2003.
8. V. Hristidis and Y. Papakonstantinou. DISCOVER: Keyword Search in Relational Databases. In VLDB '02, pages 670-681. VLDB Endowment, August 2002.
9. B. J. Jansen and A. Spink. How are we searching the World Wide Web? A comparison of nine search engine transaction logs. Information Processing and Management, 42(1):248-263, 2006.
10. V. Kacholia, S. Pandit, S. Chakrabarti, S. Sudarshan, R. Desai, and H. Karambelkar. Bidirectional Expansion For Keyword Search on Graph Databases. In VLDB '05, pages 505-516, August 2005.
11. R. M. Karp. Reducibility Among Combinatorial Problems. Xomplexity of Computer Computations, 43:85-103, 1972.
12. F. Liu, C. Yu, W. Meng, and A. Chowdhury. Effective Keyword Search in Relational Databases. In SIGMOD '06, pages 563-574, June 2006.
13. Y. Luo, X. Lin, W. Wang, and X. Zhou. SPARK: Top-k Keyword Query in Relational Databases. In SIGMOD '07, pages 115-126, June 2007. (Pubitemid 47630801)
14. C. D. Manning, P. Raghavan, and H. Schütze. Introduction to Information Retrieval. Cambridge University Press, New York, NY, 2008.
15. W. May. Information Extraction and Integration with Florid: The Mondial Case Study. Technical Report 131, Universität Freiburg, Institut für Informatik, 1999. Available from http://dbis.informatik.uni-goettingen.de/ Mondial.
16. S. Robertson, H. Zaragoza, and M. Taylor. Simple BM25 Extension to Multiple Weighted Fields. In CIKM '04, pages 42-49, November 2004.
17. D. E. Rose and D. R. Cutting. Ranking for Usability: Enhanced Retrieval for Short Queries. Technical Report 163, Apple, 1996.
18. A. Singhal. Modern Information Retrieval: A Brief Overview. Bulletin of the IEEE Computer Society Technical Committee on Data Engineering, pages 35-42, December 2001.
19. Q. Su and J. Widom. Indexing Relational Database Content Offline for Efficient Keyword-Based Search. In IDEAS '05, pages 297-306, July 2005.
20. R. Wilkinson. Effective Retrieval of Structured Documents. In SIGIR '94, pages 311-317, August 1994.
21. R. Wilkinson, J. Zobel, and R. Sacks-Davis. Similarity Measures for Short Queries. In TREC-4, pages 277-285, November 1995.