Sciweavers

2883 search results - page 20 / 577
» Algorithms for merged indexes
Sort
View
CORR
2010
Springer
196views Education» more  CORR 2010»
13 years 8 months ago
Comparison Of Modified Dual Ternary Indexing And Multi-Key Hashing Algorithms For Music Information Retrieval
In this work we have compared two indexing algorithms that have been used to index and retrieve Carnatic music songs. We have compared a modified algorithm of the Dual ternary ind...
Rajeswari Sridhar, A. Amudha, S. Karthiga, T. V. G...
IPPS
2002
IEEE
14 years 1 months ago
Load-Balanced Parallel Merge Sort on Distributed Memory Parallel Computers
Sort can be speeded up on parallel computers by dividing and computing data individually in parallel. Merge sort can be parallelized, however, the conventional algorithm implement...
Minsoo Jeon, Dongseung Kim
FQAS
2006
Springer
99views Database» more  FQAS 2006»
14 years 9 days ago
Partition-Based Approach to Processing Batches of Frequent Itemset Queries
We consider the problem of optimizing processing of batches of frequent itemset queries. The problem is a particular case of multiple-query optimization, where the goal is to minim...
Przemyslaw Grudzinski, Marek Wojciechowski, Maciej...
SEMWEB
2004
Springer
14 years 2 months ago
Top-k Query Evaluation for Schema-Based Peer-to-Peer Networks
Abstract. Increasing the number of peers in a peer-to-peer network usually increases the number of answers to a given query as well. While having more answers is nice in principle,...
Wolfgang Nejdl, Wolf Siberski, Uwe Thaden, Wolf-Ti...
SIGMOD
1996
ACM
180views Database» more  SIGMOD 1996»
14 years 24 days ago
Partition Based Spatial-Merge Join
This paper describes PBSM (Partition Based Spatial
Jignesh M. Patel, David J. DeWitt