Sciweavers

2850 search results - page 286 / 570
» Answering Queries using Humans, Algorithms and Databases
Sort
View
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
16 years 4 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
SIGIR
2006
ACM
15 years 10 months ago
Probabilistic latent query analysis for combining multiple retrieval sources
Combining the output from multiple retrieval sources over the same document collection is of great importance to a number of retrieval tasks such as multimedia retrieval, web retr...
Rong Yan, Alexander G. Hauptmann
ICDT
2009
ACM
166views Database» more  ICDT 2009»
16 years 4 months ago
A compositional framework for complex queries over uncertain data
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
Christoph Koch, Michaela Götz
ICDE
1996
IEEE
103views Database» more  ICDE 1996»
16 years 5 months ago
Using Partial Differencing for Efficient Monitoring of Deferred Complex Rule Conditions
This paper presents a difference calculus for determining changes to rule conditions in an active DBMS. The calculus has been used for implementing an algorithm to efficiently mon...
Martin Sköld, Tore Risch
NCA
2008
IEEE
15 years 10 months ago
Sorting Based Data Centric Storage
— Data-centric storage [6] is a very important concept for sensor networks that supports efficient in-network data query and processing. Previous approaches are mostly using a h...
Fenghui Zhang, Anxiao Jiang, Jianer Chen