Sciweavers

9871 search results - page 1860 / 1975
» On the Structure of Low Sets
Sort
View
SIGMOD
2009
ACM
215views Database» more  SIGMOD 2009»
16 years 6 months ago
Efficient type-ahead search on relational data: a TASTIER approach
Existing keyword-search systems in relational databases require users to submit a complete query to compute answers. Often users feel "left in the dark" when they have l...
Guoliang Li, Shengyue Ji, Chen Li, Jianhua Feng
SIGMOD
2008
ACM
193views Database» more  SIGMOD 2008»
16 years 6 months ago
ARCube: supporting ranking aggregate queries in partially materialized data cubes
Supporting ranking queries in database systems has been a popular research topic recently. However, there is a lack of study on supporting ranking queries in data warehouses where...
Tianyi Wu, Dong Xin, Jiawei Han
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
16 years 6 months ago
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
Elke Achtert, Christian Böhm, Peer Kröge...
SIGMOD
2006
ACM
89views Database» more  SIGMOD 2006»
16 years 6 months ago
Testing database applications
Testing of database applications is crucial for ensuring high software quality as undetected faults can result in unrecoverable data corruption. The problem of database applicatio...
Carsten Binnig, Donald Kossmann, Eric Lo
SIGMOD
2006
ACM
232views Database» more  SIGMOD 2006»
16 years 6 months ago
To search or to crawl?: towards a query optimizer for text-centric tasks
Text is ubiquitous and, not surprisingly, many important applications rely on textual data for a variety of tasks. As a notable example, information extraction applications derive...
Panagiotis G. Ipeirotis, Eugene Agichtein, Pranay ...
« Prev « First page 1860 / 1975 Last » Next »