6004 search results - page 320 / 1201 » Parallelizing query optimization |
114
Voted
DKE
2006
15 years 23 days ago
2006
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
106
Voted
IS
2007
15 years 20 days ago
2007
: A number of indexing techniques have been proposed in recent times for optimizing the queries on XML and other semistructured data models. Most of the semistructured models use t...
83
Voted
KDD
2005
ACM
16 years 1 months ago
2005
ACM
We present an algorithm for mining tree-shaped patterns in a large graph. Novel about our class of patterns is that they can contain constants, and can contain existential nodes w...
100
click to vote
PODS
2005
ACM
16 years 26 days ago
2005
ACM
In sensor networks, data acquisition frequently takes place at lowcapability devices. The acquired data is then transmitted through a hierarchy of nodes having progressively incre...
120
Voted
SSDBM
2002
IEEE
15 years 5 months ago
2002
IEEE
This paper presents an approach to answering queries over an ontology modelled using a description logic. The ontology acts as a global schema, providing a declarative description...