2514 search results - page 91 / 503 » On the Computation of Approximations of Database Queries |
177
click to vote
CIKM
2010
Springer
15 years 5 months ago
2010
Springer
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
138
click to vote
ICCS
2005
Springer
15 years 12 months ago
2005
Springer
We have previously described a hybrid keyword search that combines metadata search with a traditional keyword search over unstructured context data. This hybrid search paradigm pro...
270
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
Top-k processing in uncertain databases is semantically and computationally different from traditional top-k processing. The interplay between query scores and data uncertainty ma...
109
click to vote
VLDB
2004
ACM
15 years 11 months ago
2004
ACM
Query processing in database systems has developed beyond mere exact matching of attribute values. Scoring database objects and retrieving only the top k matches or Pareto-optimal...
185
click to vote
SLE
2009
Springer
16 years 27 days ago
2009
Springer
One of the most ubiquitous elements of modern computing is the relational database. Very few modern applications are created without some sort of database backend. Unfortunately, r...