Sciweavers

342 search results - page 13 / 69
» Branch-and-bound processing of ranked queries
Sort
View
PVLDB
2008
136views more  PVLDB 2008»
13 years 7 months ago
Keyword query cleaning
Unlike traditional database queries, keyword queries do not adhere to predefined syntax and are often dirty with irrelevant words from natural languages. This makes accurate and e...
Ken Q. Pu, Xiaohui Yu
SIGMOD
2009
ACM
189views Database» more  SIGMOD 2009»
14 years 7 months ago
Generic and effective semi-structured keyword search
Current semi-structured keyword search and natural language query processing systems use ad hoc approaches to take advantage of structural information. Although intuitive, they ar...
Arash Termehchy, Marianne Winslett
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
14 years 7 months ago
Ranking distributed probabilistic data
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
Feifei Li, Ke Yi, Jeffrey Jestes
CIKM
2008
Springer
13 years 9 months ago
Search-based query suggestion
In this paper, we proposed a unified strategy to combine query log and search results for query suggestion. In this way, we leverage both the users' search intentions for pop...
Jiang-Ming Yang, Rui Cai, Feng Jing, Shuo Wang, Le...
PVLDB
2008
118views more  PVLDB 2008»
13 years 7 months ago
Efficient top-k processing over query-dependent functions
We study the efficient evaluation of top-k queries over data items, where the score of each item is dynamically computed by applying an item-specific function whose parameter valu...
Lin Guo, Sihem Amer-Yahia, Raghu Ramakrishnan, Jay...