709 search results - page 51 / 142 » Efficient Evaluation of All-Nearest-Neighbor Queries |
161
click to vote
DASFAA
2009
IEEE
15 years 9 months ago
2009
IEEE
Graph-structured databases and related problems such as reachability query processing have been increasingly relevant to many applications such as XML databases, biological databas...
175
click to vote
CIKM
1994
Springer
15 years 10 months ago
1994
Springer
This paper argues that most queries in object-oriented databases require traversing from one object to another in the aggregation hierarchy. Thus, the connections between objects ...
256
click to vote
ICDT
2009
ACM
16 years 6 months ago
2009
ACM
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
173
click to vote
VLDB
1989
ACM
15 years 9 months ago
1989
ACM
This paper presents a parallel algorithm for recursive query processing and shows how it can be efficiently implemented in a local computer network. The algorithm relies on an int...
248
click to vote
ICDE
2003
IEEE
16 years 7 months ago
2003
IEEE
In order to publish a nested XML document from flat relational data, multiple SQL queries are often needed. The efficiency of publishing relies on how fast these queries can be ev...