116 search results - page 6 / 24 » Measuring the Complexity of Join Enumeration in Query Optimi... |
SIGMOD
2010
ACM
15 years 2 months ago
2010
ACM
The probabilistic threshold query (PTQ) is one of the most common queries in uncertain databases, where all results satisfying the query with probabilities that meet the threshold...
SSDBM
2005
IEEE
15 years 3 months ago
2005
IEEE
To discover knowledge or retrieve information from a relational database, a user often needs to find objects related to certain source objects. There are two main challenges in b...
163
Voted
SYRCODIS
2008
14 years 11 months ago
2008
In the last few years, XML became a de-facto standard for the exchange of structured and semi-structured data. The database research community took this development into account b...
PODS
2008
ACM
15 years 9 months ago
2008
ACM
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
116
Voted
VLDB
2001
ACM
15 years 1 months ago
2001
ACM
Most modern DBMS optimizers rely upon a cost model to choose the best query execution plan (QEP) for any given query. Cost estimates are heavily dependent upon the optimizer’s e...