Sciweavers

101 search results - page 16 / 21
» Query optimization techniques for partitioned tables
Sort
View
ICDE
2003
IEEE
148views Database» more  ICDE 2003»
14 years 9 months ago
Efficient Computation of Subqueries in Complex OLAP
Expressing complex OLAP queries using group-by, aggregation, and joins can be extremely difficult. As a result of this, many alternate ways of expressing such queries have been de...
Michael H. Böhlen, Michael O. Akinde
EDBT
1998
ACM
155views Database» more  EDBT 1998»
13 years 12 months ago
Improving the Query Performance of High-Dimensional Index Structures by Bulk-Load Operations
Abstract. In this paper, we propose a new bulk-loading technique for high-dimensional indexes which represent an important component of multimedia database systems. Since it is ver...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
CVPR
2010
IEEE
14 years 4 months ago
Fast Globally Optimal 2D Human Detection with Loopy Graph Models
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
Tai-Peng Tian, Stan Sclaroff
SIGIR
2012
ACM
11 years 10 months ago
Optimizing positional index structures for versioned document collections
Versioned document collections are collections that contain multiple versions of each document. Important examples are Web archives, Wikipedia and other wikis, or source code and ...
Jinru He, Torsten Suel
ICDE
2010
IEEE
379views Database» more  ICDE 2010»
14 years 7 months ago
Osprey: Implementing MapReduce-Style Fault Tolerance in a Shared-Nothing Distributed Database
In this paper, we describe a scheme for tolerating and recovering from mid-query faults in a distributed shared nothing database. Rather than aborting and restarting queries, our s...
Christopher Yang, Christine Yen, Ceryen Tan, Samue...