486 search results - page 69 / 98 » An Efficient Path Index for Querying Semi-structured Data |
171
click to vote
ICDE
2007
IEEE
16 years 1 months ago
2007
IEEE
A k-nearest neighbor (k-NN) query retrieves k objects from a database that are considered to be the closest to a given query point. Numerous techniques have been proposed in the p...
110
click to vote
KDD
2007
ACM
16 years 8 days ago
2007
ACM
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
191
click to vote
SIGMOD
2006
ACM
16 years 9 hour ago
2006
ACM
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
175
click to vote
SIGMOD
2008
ACM
16 years 10 hour ago
2008
ACM
The problem of skyline computation has attracted considerable research attention. In the categorical domain the problem becomes more complicated, primarily due to the partially-or...
132
click to vote
PVLDB
2008
14 years 10 months ago
2008
Keyword search in XML repositories is a powerful tool for interactive data exploration. Much work has recently been done on making XML search aware of relationship information emb...