Sciweavers

73 search results - page 8 / 15
» Distributed Query Processing Using Partitioned Inverted File...
Sort
View
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
15 years 4 months ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer
MIE
2008
160views Healthcare» more  MIE 2008»
15 years 1 months ago
Using Medline Queries to Generate Image Retrieval Tasks for Benchmarking
Medical visual information retrieval has been a very active research area over the past ten years as an increasing amount of images is produced digitally and made available in the ...
Henning Müller, Jayashree Kalpathy-Cramer, Wi...
EDBT
2011
ACM
256views Database» more  EDBT 2011»
14 years 3 months ago
RanKloud: a scalable ranked query processing framework on hadoop
The popularity of batch-oriented cluster architectures like Hadoop is on the rise. These batch-based systems successfully achieve high degrees of scalability by carefully allocati...
K. Selçuk Candan, Parth Nagarkar, Mithila N...
ICDE
2007
IEEE
120views Database» more  ICDE 2007»
15 years 6 months ago
Optimizing State-Intensive Non-Blocking Queries Using Run-time Adaptation
Main memory is a critical resource when processing non-blocking queries with state intensive operators that require real-time responses. While partitioned parallel processing can ...
Bin Liu, Mariana Jbantova, Elke A. Rundensteiner
KDD
2007
ACM
186views Data Mining» more  KDD 2007»
16 years 2 days ago
Content-based document routing and index partitioning for scalable similarity-based searches in a large corpus
We present a document routing and index partitioning scheme for scalable similarity-based search of documents in a large corpus. We consider the case when similarity-based search ...
Deepavali Bhagwat, Kave Eshghi, Pankaj Mehra