390 search results - page 50 / 78 » Approximate Query Answering in Locally Closed Databases |
BTW
2007
Springer
15 years 1 months ago
2007
Springer
: 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, has received increasing a...
154
click to vote
ICDE
2004
IEEE
15 years 11 months ago
2004
IEEE
XML and other types of semi-structured data are typically represented by a labeled directed graph. To speed up path expression queries over the graph, a variety of structural inde...
198
click to vote
ICDE
2012
IEEE
13 years 7 days ago
2012
IEEE
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
186
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
XML streams, such as RSS feeds or complex event streams, are becoming increasingly pervasive as they provide the foundation for a wide range of emerging applications. An important...
ICDE
2009
IEEE
15 years 4 months ago
2009
IEEE
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...