46 search results - page 8 / 10 » Efficiently Supporting Multiple Similarity Queries for Minin... |
ICDE
2006
IEEE
14 years 8 months ago
2006
IEEE
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
DASFAA
2004
IEEE
13 years 10 months ago
2004
IEEE
For event filtering of publish/subscribe system, significant research efforts have been dedicated to techniques based on multiple one-dimensional indexes built on attributes of sub...
KDD
2012
ACM
11 years 9 months ago
2012
ACM
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
ICDE
2002
IEEE
14 years 8 months ago
2002
IEEE
Obtaining fast and good quality approximations to data distributions is a problem of central interest to database management. A variety of popular database applications including,...
GIS
2010
ACM
13 years 5 months ago
2010
ACM
The quality of a local search engine, such as Google and Bing Maps, heavily relies on its geographic datasets. Typically, these datasets are obtained from multiple sources, e.g., ...