Sciweavers

184 search results - page 10 / 37
» A new range query algorithm for Universal B-trees
Sort
View
CORR
2010
Springer
120views Education» more  CORR 2010»
14 years 6 months ago
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
Jérémy Barbay, Johannes Fischer
AI
2008
Springer
15 years 6 months ago
A Frequency Mining-Based Algorithm for Re-ranking Web Search Engine Retrievals
Abstract. Conventional web search engines retrieve too many documents for the majority of the submitted queries; therefore, they possess a good recall, since there are far more pag...
M. Barouni-Ebrahimi, Ebrahim Bagheri, Ali A. Ghorb...
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
COMAD
2009
15 years 26 days ago
On the Complexity of Multi-Query Optimization in Stream Grids
Stream grids are wide-area grid computing environments that are fed by a set of stream data sources. Such grids are becoming more wide-spread due to the large scale deployment of ...
Saikat Mukherjee, Srinath Srinivasa, Krithi Ramamr...
INFOSCALE
2007
ACM
15 years 1 months ago
SDI: a swift tree structure for multi-dimensional data indexing in peer-to-peer networks
Efficient multi-dimensional data search has received much attention in centralized systems. However, its implementation in large-scale distributed systems is not a trivial job and...
Rong Zhang, Weining Qian, Minqi Zhou, Aoying Zhou