ACM DL

Database Systems (TODS)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Database Systems (TODS), Volume 18 Issue 2, June 1993

Finite representation of infinite query answers
Jan Chomicki, Tomasz Imieliński
Pages: 181-223
DOI: 10.1145/151634.151635
We define here a formal notion of finite representation of infinite query answers in logic programs. We apply this notion to DatalognS programs may be infinite and consequently queries may have infinite answers....

Processing time-constrained aggregate queries in CASE-DB
Wen-Chi Hou, Gultekin Ozsoyoglu
Pages: 224-261
DOI: 10.1145/151634.151636
In this paper, we present an algorithm to strictly control the time to process an estimator for an aggregate relational query. The algorithm implemented in a prototype database management system, called CASE-DB, iteratively samples from input...

Stochastic query optimization in distributed databases
P. E. Drenick, E. J. Smith
Pages: 262-288
DOI: 10.1145/151634.151637
Many algorithms have been devised for minimizing the costs associated with obtaining the answer to a single, isolated query in a distributed database system. However, if more than one query may be processed by the system at the same time and if...

Open commit protocols tolerating commission failures
Kurt Rothermel, Stefan Pappe
Pages: 289-332
DOI: 10.1145/151634.151638
To ensure atomicity of transactions in distributed systems so-called 2-phase commit (2PC) protocols have been proposed. The basic assumption of these protocols is that the processing nodes involved in transactions are “sane,” i.e.,...

Empirical performance evaluation of concurrency and coherency control protocols for database sharing systems
Erhard Rahm
Pages: 333-377
DOI: 10.1145/151634.151639
Database Sharing (DB-sharing) refers to a general approach for building a distributed high performance transaction system. The nodes of a DB-sharing system are locally coupled via a high-speed interconnect and share a common database at the disk...