6846 search results - page 214 / 1370 » Querying a summary of database |
155
click to vote
BTW
2005
Springer
16 years 2 days ago
2005
Springer
: Optimizers in modern DBMSs utilize a cost model to choose an efficient query execution plan (QEP) among all possible ones for a given query. The accuracy of the cost estimates de...
153
click to vote
ICDCSW
2005
IEEE
16 years 4 days ago
2005
IEEE
Existing cluster-based searching schemes in unstructured peer-to-peer (P2P) networks employ flooding/random forwarding on connected dominating sets (CDS) of networks. There exist...
156
click to vote
SIGIR
2009
ACM
16 years 1 months ago
2009
ACM
We study the recurrence dynamics of queries in Web search by analysing a large real-world query log dataset. We find that query frequency is more useful in predicting collective ...
163
click to vote
SSD
2001
Springer
15 years 11 months ago
2001
Springer
In this paper we introduce the notion of constrained nearest neighbor queries (CNN) and propose a series of methods to answer them. This class of queries can be thought of as neare...
170
click to vote
DEXAW
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper describes an algebra for use with parallel object databases, and in particular ODMG compliant databases with OQL. Although there have been many proposals for parallel r...