Sciweavers

1992 search results - page 180 / 399
» Implementing sorting in database systems
Sort
View
EUROSYS
2010
ACM
14 years 3 months ago
Otherworld: giving applications a chance to survive OS kernel crashes
In this paper, we present a mechanism that allows applications to survive operating system kernel crashes and continue functioning with no application data loss after a system reb...
Alex Depoutovitch, Michael Stumm
SIGMOD
2006
ACM
170views Database» more  SIGMOD 2006»
14 years 11 months ago
COLT: continuous on-line tuning
Self-tuning is a cost-effective and elegant solution to the important problem of configuring a database to the characteristics of the query load. Existing techniques operate in an...
Karl Schnaitter, Serge Abiteboul, Tova Milo, Neokl...
CIDR
2011
223views Algorithms» more  CIDR 2011»
13 years 2 months ago
No bits left behind
One of the key tenets of database system design is making efficient use of storage and memory resources. However, existing database system implementations are actually extremely ...
Eugene Wu 0002, Carlo Curino, Samuel Madden
VLDB
2003
ACM
114views Database» more  VLDB 2003»
14 years 11 months ago
Managing multiple and distributed ontologies on the Semantic Web
Abstract. In traditional software systems, significant attention is devoted to keeping modules well separated and coherent with respect to functionality, thus ensuring that changes...
Alexander Maedche, Boris Motik, Ljiljana Stojanovi...
DEXAW
2003
IEEE
122views Database» more  DEXAW 2003»
14 years 4 months ago
Fairness in Wallets with Observer
We examine the interference of fairness and observers in digital coin systems. Since copying of coins cannot be prevented cryptographically in anonymous off-line coin systems, dou...
Heike Neumann, Thomas Schwarzpaul