6650 search results - page 183 / 1330 » Mutating database queries |
125
click to vote
BTW
2005
Springer
15 years 9 months 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...
119
Voted
SIGIR
2009
ACM
15 years 10 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 ...
131
click to vote
SSD
2001
Springer
15 years 8 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...
133
click to vote
DEXAW
1999
IEEE
15 years 8 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...
220
click to vote
ICDE
2006
IEEE
16 years 5 months ago
2006
IEEE
Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. ...