Sciweavers

55 search results - page 1 / 11
» Generic Database Cost Models for Hierarchical Memory Systems
Sort
View
VLDB
2002
ACM
108views Database» more  VLDB 2002»
13 years 4 months ago
Generic Database Cost Models for Hierarchical Memory Systems
Accurate prediction of operator execution time is a prerequisite for database query optimization. Although extensively studied for conventional disk-based DBMSs, cost modeling in ...
Stefan Manegold, Peter A. Boncz, Martin L. Kersten
ICDE
2009
IEEE
143views Database» more  ICDE 2009»
13 years 11 months ago
Supporting Generic Cost Models for Wide-Area Stream Processing
— Existing stream processing systems are optimized for a specific metric, which may limit their applicability to diverse applications and environments. This paper presents XFlow...
Olga Papaemmanouil, Ugur Çetintemel, John J...
FODO
1998
Springer
242views Algorithms» more  FODO 1998»
13 years 9 months ago
Optimizing OID Indexing Cost in Temporal Object-Oriented Database Systems
In object-oriented database systems (OODB) with logical OIDs, an OID index (OIDX) is needed to map from OID to the physical location of the object. In a transaction time temporal ...
Kjetil Nørvåg, Kjell Bratbergsengen
ICDE
2010
IEEE
221views Database» more  ICDE 2010»
13 years 5 months ago
A generic auto-provisioning framework for cloud databases
— We discuss the problem of resource provisioning for database management systems operating on top of an Infrastructure-As-A-Service (IaaS) cloud. To solve this problem, we descr...
Jennie Rogers, Olga Papaemmanouil, Ugur Çet...
ICS
1999
Tsinghua U.
13 years 9 months ago
Nonlinear array layouts for hierarchical memory systems
Programming languages that provide multidimensional arrays and a flat linear model of memory must implement a mapping between these two domains to order array elements in memory....
Siddhartha Chatterjee, Vibhor V. Jain, Alvin R. Le...