Sciweavers

1391 search results - page 260 / 279
» Knowledge Retrieval (KR)
Sort
View
SIGMOD
2009
ACM
190views Database» more  SIGMOD 2009»
14 years 7 months ago
DataLens: making a good first impression
When a database query has a large number of results, the user can only be shown one page of results at a time. One popular approach is to rank results such that the "best&quo...
Bin Liu, H. V. Jagadish
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
14 years 7 months ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
Xiaochun Yang, Bin Wang, Chen Li
SIGMOD
2007
ACM
188views Database» more  SIGMOD 2007»
14 years 7 months ago
Keyword search on relational data streams
Increasing monitoring of transactions, environmental parameters, homeland security, RFID chips and interactions of online users rapidly establishes new data sources and applicatio...
Alexander Markowetz, Yin Yang, Dimitris Papadias
SIGMOD
2006
ACM
426views Database» more  SIGMOD 2006»
14 years 7 months ago
Effective keyword search in relational databases
With the amount of available text data in relational databases growing rapidly, the need for ordinary users to search such information is dramatically increasing. Even though the ...
Fang Liu, Clement T. Yu, Weiyi Meng, Abdur Chowdhu...
PODS
2005
ACM
151views Database» more  PODS 2005»
14 years 7 months ago
Estimating arbitrary subset sums with few probes
Suppose we have a large table T of items i, each with a weight wi, e.g., people and their salary. In a general preprocessing step for estimating arbitrary subset sums, we assign e...
Noga Alon, Nick G. Duffield, Carsten Lund, Mikkel ...