Sciweavers

184 search results - page 15 / 37
» Cache-oblivious data structures for orthogonal range searchi...
Sort
View
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
15 years 12 months ago
Efficient k-NN search on vertically decomposed data
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...
SIGMOD
1999
ACM
112views Database» more  SIGMOD 1999»
15 years 4 months ago
A New Method for Similarity Indexing of Market Basket Data
In recent years, many data mining methods have been proposed for finding useful and structured information from market basket data. The association rule model was recently propos...
Charu C. Aggarwal, Joel L. Wolf, Philip S. Yu
WWW
2009
ACM
16 years 14 days ago
Dataplorer: a scalable search engine for the data web
More and more structured information in the form of semantic data is nowadays available. It offers a wide range of new possibilities especially for semantic search and Web data in...
Haofen Wang, Qiaoling Liu, Gui-Rong Xue, Yong Yu, ...
PVLDB
2010
252views more  PVLDB 2010»
14 years 6 months ago
Efficient and Effective Similarity Search over Probabilistic Data based on Earth Mover's Distance
Probabilistic data is coming as a new deluge along with the technical advances on geographical tracking, multimedia processing, sensor network and RFID. While similarity search is...
Jia Xu, Zhenjie Zhang, Anthony K. H. Tung, Ge Yu
GIR
2006
ACM
15 years 5 months ago
Range-capable Distributed Hash Tables
In this paper, we present a novel indexing data structure called RDHT (Range capable Distributed Hash Table) derived from skip lists and specifically designed for storing and retr...
Alessandro Soro, Cristian Lai