Sciweavers

709 search results - page 82 / 142
» Efficient Evaluation of All-Nearest-Neighbor Queries
Sort
View
SIGMOD
2007
ACM
187views Database» more  SIGMOD 2007»
16 years 6 months ago
P-ring: an efficient and robust P2P range index structure
Data availability, collection and storage have increased dramatically in recent years, raising new technological and algorithmic challenges for database design and data management...
Adina Crainiceanu, Prakash Linga, Ashwin Machanava...
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
16 years 6 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...
WWW
2008
ACM
16 years 6 months ago
Efficient multi-keyword search over p2p web
Current search mechanisms of DHT-based P2P systems can well handle a single keyword search problem. Other than single keyword search, multi-keyword search is quite popular and use...
Hanhua Chen, Hai Jin, Jiliang Wang, Lei Chen 0002,...
KDD
2009
ACM
227views Data Mining» more  KDD 2009»
16 years 6 months ago
Efficiently learning the accuracy of labeling sources for selective sampling
Many scalable data mining tasks rely on active learning to provide the most useful accurately labeled instances. However, what if there are multiple labeling sources (`oracles...
Pinar Donmez, Jaime G. Carbonell, Jeff Schneider
SIGMOD
2009
ACM
201views Database» more  SIGMOD 2009»
16 years 6 months ago
Cost based plan selection for xpath
We present a complete XPath cost-based optimization and execution framework and demonstrate its effectiveness and efficiency for a variety of queries and datasets. The framework i...
Haris Georgiadis, Minas Charalambides, Vasilis Vas...