2223 search results - page 204 / 445 » Query Optimization in an OODBMS |
208
click to vote
SSD
2007
Springer
15 years 10 months ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
124
click to vote
VLDB
2001
ACM
15 years 8 months ago
2001
ACM
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...
133
click to vote
PODS
2005
ACM
16 years 4 months ago
2005
ACM
We consider query optimization techniques for data intensive P2P applications. We show how to adapt an old technique from deductive databases, namely Query-Sub-Query (QSQ), to a s...
130
click to vote
BTW
2007
Springer
15 years 10 months ago
2007
Springer
: Database-internal statistics are very important for cost-based query optimizers. Only if an optimizer has accurate statistical information about data, it provides excellent execu...
155
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...