2736 search results - page 345 / 548 » Indexing uncertain data |
280
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
With the proliferation of the RDF data format, engines for RDF query processing are faced with very large graphs that contain hundreds of millions of RDF triples. This paper addre...
265
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
259
click to vote
SIGMOD
2006
ACM
16 years 6 months ago
2006
ACM
To enable efficient similarity search in large databases, many indexing techniques use a linear transformation scheme to reduce dimensions and allow fast approximation. In this re...
184
click to vote
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
Spatial database operations are typically performed in two steps. In the filtering step, indexes and the minimum bounding rectangles (MBRs) of the objects are used to quickly dete...
166
click to vote
EDBT
2006
ACM
16 years 6 months ago
2006
ACM
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance prec...