3269 search results - page 310 / 654 » Query Optimization for XML |
134
click to vote
SIGMOD
2004
ACM
16 years 5 months ago
2004
ACM
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
133
Voted
FOCS
2006
IEEE
15 years 11 months ago
2006
IEEE
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
124
Voted
BTW
2003
Springer
15 years 10 months ago
2003
Springer
: Due to the ever increasing impacts of globalization, people will/have to work on data which is distributed all around the world [LKK+ 97]. Query processing on the corresponding d...
156
click to vote
SSDBM
2008
IEEE
15 years 11 months ago
2008
IEEE
Increasingly, many data sources appear as online databases, hidden behind query forms, thus forming what is referred to as the deep web. It is desirable to have systems that can pr...
122
click to vote
CN
2006
15 years 4 months ago
2006
In peer-to-peer (P2P) systems where individual peers must cooperate to process each other's requests, a useful metric for evaluating the system is how many remote requests ar...