Sciweavers

40 search results - page 3 / 8
» Write Optimized Object-Oriented Database Systems
Sort
View
VLDB
2004
ACM
92views Database» more  VLDB 2004»
13 years 10 months ago
Write-Optimized B-Trees
Large writes are beneficial both on individual disks and on disk arrays, e.g., RAID-5. The presented design enables large writes of internal B-tree nodes and leaves. It supports b...
Goetz Graefe
DASFAA
2011
IEEE
250views Database» more  DASFAA 2011»
12 years 9 months ago
An FTL-Agnostic Layer to Improve Random Write on Flash Memory
Flash memories are considered a competitive alternative to rotating disks as non-volatile data storage for database management systems. However, even if the Flash Translation Layer...
Brice Chardin, Olivier Pasteur, Jean-Marc Petit
SIGMOD
2010
ACM
364views Database» more  SIGMOD 2010»
13 years 10 months ago
Optimizing schema-last tuple-store queries in graphd
Current relational databases require that a database schema exist prior to data entry and require manual optimization for best performance. We describe the query optimization tech...
Scott M. Meyer, Jutta Degener, John Giannandrea, B...
MSS
1999
IEEE
140views Hardware» more  MSS 1999»
13 years 9 months ago
Pursuit of a Scalable High Performance Multi-Petabyte Database
When the BaBar experiment at the Stanford Linear Accelerator Center starts in April 1999, it will generate approximately 200TB/year of data at a rate of 10MB/sec for 10 years. A m...
Andrew Hanushevsky, Marcia Nowark
ICDT
1995
ACM
79views Database» more  ICDT 1995»
13 years 8 months ago
Optimization Using Tuple Subsumption
A tuple t1 of relation R subsumes tuple t2 of R, with respect to a query Q if for every database, tuple t1 derives all, and possibly more, answers to query Q than derived by tuple ...
Venky Harinarayan, Ashish Gupta