Paper Info
Title
Correctness and parallelism in composite systems
Abstract
In recent years, databases have started to be used as intelligentrepositories for a variety of semantically-richer systems.A consequence of such architectures is that transactionscheduling takes place throughout composite systemsconsisting of layered subsystems. Such transaction architectureshave been studied extensively. Existing theory, however,limits the degree of parallelism, and makes a number ofsimplifying assumptions which cannot be taken for grantedin practice.This paper...
Year
DOI
Venue
1997
10.1145/263661.263683
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Keywords
Field
DocType
composite system,nearest neighbor search
Computer science,Correctness,Composite number,Theoretical computer science,Nearest neighbor search
Conference
ISBN
Citations 
PageRank 
0-89791-910-6
16
4.73
References 
Authors
25
4
Name
Order
Citations
PageRank
Gustavo Alonso15476612.79
Stephen Blott21002168.03
Armin Fessler34617.71
Hans-Jörg Schek439951366.90