Sciweavers

DPD
2002
168views more  DPD 2002»
13 years 7 months ago
Evolutionary Algorithms for Allocating Data in Distributed Database Systems
A major cost in executing queries in a distributed database system is the data transfer cost incurred in transferring relations (fragments) accessed by a query from different sites...
Ishfaq Ahmad, Kamalakar Karlapalem, Yu-Kwong Kwok,...
SIGCSE
2008
ACM
103views Education» more  SIGCSE 2008»
13 years 7 months ago
A query simulation system to illustrate database query execution
The underlying processes that enable database query execution are fundamental to understanding database management systems. However, these processes are complex and can be difficu...
Brett Allenstein, Andrew Yost, Paul Wagner, Joline...
CONCURRENCY
2006
148views more  CONCURRENCY 2006»
13 years 7 months ago
An adaptive parallel query processing middleware for the Grid
vices provide an important abstract layer on top of heterogeneous components (hardware and software) that take part into a grid environment. In this scenario, applications, like sc...
Vinícius F. V. da Silva, Márcio L. D...
DAMON
2008
Springer
13 years 9 months ago
DSM vs. NSM: CPU performance tradeoffs in block-oriented query processing
Comparisons between the merits of row-wise storage (NSM) and columnar storage (DSM) are typically made with respect to the persistent storage layer of database systems. In this pa...
Marcin Zukowski, Niels Nes, Peter A. Boncz
VLDB
1992
ACM
111views Database» more  VLDB 1992»
13 years 11 months ago
Using Segmented Right-Deep Trees for the Execution of Pipelined Hash Joins
In this paper, we explore the execution of pipelined hash joins in a multiprocessor-based database system. To improve the query execution, an innovative approach on query executio...
Ming-Syan Chen, Ming-Ling Lo, Philip S. Yu, Honest...
DAWAK
2001
Springer
14 years 2 days ago
Shared Index Scans for Data Warehouses
Tree based indexing structures like -trees, ·-trees, Bitmap indexes and Ê-trees have become essential for getting good performance when accessing vast datasets. However, most dat...
Yannis Kotidis, Yannis Sismanis, Nick Roussopoulos
P2P
2003
IEEE
205views Communications» more  P2P 2003»
14 years 26 days ago
Peer-to-Peer Spatial Queries in Sensor Networks
Sensor networks, that consist of potentially several thousands of nodes each with sensing (heat, sound, light, magnetism, etc.) and wireless communication capabilities, provide gr...
Murat Demirbas, Hakan Ferhatosmanoglu
VLDB
2004
ACM
111views Database» more  VLDB 2004»
14 years 28 days ago
Lifting the Burden of History from Adaptive Query Processing
Adaptive query processing schemes attempt to reoptimize query plans during the course of query execution. A variety of techniques for adaptive query processing have been proposed,...
Amol Deshpande, Joseph M. Hellerstein
VLDB
2005
ACM
151views Database» more  VLDB 2005»
14 years 1 months ago
Query Execution Assurance for Outsourced Databases
In this paper we propose and analyze a method for proofs of actual query execution in an outsourced database framework, in which a client outsources its data management needs to a...
Radu Sion
VLDB
2005
ACM
126views Database» more  VLDB 2005»
14 years 1 months ago
Consistently Estimating the Selectivity of Conjuncts of Predicates
Cost-based query optimizers need to estimate the selectivity of conjunctive predicates when comparing alternative query execution plans. To this end, advanced optimizers use multi...
Volker Markl, Nimrod Megiddo, Marcel Kutsch, Tam M...