Sciweavers

8636 search results - page 1326 / 1728
» How Developers Copy
Sort
View
137
Voted
VLDB
1994
ACM
114views Database» more  VLDB 1994»
15 years 9 months ago
Including Group-By in Query Optimization
In existing relational database systems, processing of group-by and computation of aggregate functions are always postponed until all joins are performed. In this paper, we presen...
Surajit Chaudhuri, Kyuseok Shim
186
Voted
SIGMETRICS
1992
ACM
145views Hardware» more  SIGMETRICS 1992»
15 years 9 months ago
Analysis of the Generalized Clock Buffer Replacement Scheme for Database Transaction Processing
The CLOCK algorithm is a popular buffer replacement algorithm becauseof its simplicity and its ability to approximate the performance of the Least Recently Used (LRU) replacement ...
Victor F. Nicola, Asit Dan, Daniel M. Dias
VL
1992
IEEE
192views Visual Languages» more  VL 1992»
15 years 9 months ago
Graphic Object Layout with Interactive Genetic Algorithms
Automatic graphic objectlayout methods havelong been studied in many application areas in which graphic objects should be laid out to satisfy the constraints specific to each appl...
Toshiyuki Masui
IFIP
1989
Springer
15 years 9 months ago
Software Fault Tolerance
The designation “fault tolerant software” has been used for techniques ranging from roll-back and retry to N-version programming, from data mirroring to functional redundancy....
Algirdas Avizienis
155
Voted
ICDCS
1990
IEEE
15 years 9 months ago
Implementing Fault-Tolerant Distributed Applications
This paper develops some control structures suitable for composing fault-tolerant distrib uted applications using atomic actions (atomic transactions) as building blocks, and then...
Santosh K. Shrivastava, Stuart M. Wheater
« Prev « First page 1326 / 1728 Last » Next »