default search action
ACM SIGMOD Conference 2009: Providence, Rhode Island, USA - KEYS Workshop
- M. Tamer Özsu, Yi Chen, Lei Chen:
Proceedings of the First International Workshop on Keyword Search on Structured Data, KEYS 2009, Providence, Rhode Island, USA, June 28, 2009. ACM 2009, ISBN 978-1-60558-570-3
Keynote talk 1
- Surajit Chaudhuri:
Structured data and web documents: better together? 1
Keynote talk 2
- Luis Gravano:
Querying text databases and the web: beyond traditional keyword search. 2
Keyword search algorithms
- Shiyuan Wang, Jun'ichi Tatemura, Arsany Sawires, Oliver Po, Divyakant Agrawal, Amr El Abbadi:
Hierarchical result views for keyword queries over relational databases. 3-8 - Rares Vernica, Chen Li:
Efficient top-k algorithms for fuzzy search in string collections. 9-14 - Tommy Ellkvist, Lena Strömbäck, Lauro Didier Lins, Juliana Freire:
A first study on strategies for generating workflow snippets. 15-20
Keyword query disambiguation
- Xiaohui Yu, Huxia Shi:
Query segmentation using conditional random fields. 21-26 - Ken Q. Pu:
Keyword query cleaning using hidden Markov models. 27-32 - Elena Demidova, Irina Oelze, Peter Fankhauser:
Do we mean the same?: disambiguation of extracted keyword queries for database search. 33-38
Demos and posters
- Ron Avnur:
Building search applications with Marklogic Server. 39-40 - Jiaheng Lu, Zhifeng Bao, Tok Wang Ling, Xiaofeng Meng:
XML keyword query refinement. 41-42 - Shady Elbassuoni, Maya Ramanath, Gerhard Weikum:
Language-model-based ranking in entity-relation graphs. 43-44 - Arash Termehchy, Marianne Winslett:
Generic and effective semi-structured keyword search. 45-46 - Carlos Garcia-Alvarado, Carlos Ordonez, Zhibo Chen:
DBDOC: querying and browsing databases and interrelated documents. 47-48
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.