610 search results - page 41 / 122 » Efficient Query Evaluation on Probabilistic Databases |
182
Voted
SIGMOD
2009
ACM
16 years 22 days ago
2009
ACM
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...
113
click to vote
CIKM
2011
Springer
14 years 15 days ago
2011
Springer
A growing number of applications are built on top of search engines and issue complex structured queries. This paper contributes a customisable ranking-based processing of such qu...
VLDB
2005
ACM
15 years 6 months ago
2005
ACM
This paper presents a set of algorithms for efficiently evaluating join queries over static data tables in sensor networks. We describe and evaluate three algorithms that take adv...
185
Voted
SIGMOD
2007
ACM
16 years 20 days ago
2007
ACM
With the increasing amount of text data stored in relational databases, there is a demand for RDBMS to support keyword queries over text data. As a search result is often assemble...
91
Voted
SIGMOD
2004
ACM
16 years 20 days ago
2004
ACM
In this paper, we study query evaluation on Active XML documents (AXML for short), a new generation of XML documents that has recently gained popularity. AXML documents are XML do...