Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
9,851
The Serializability of Concurrent Database Updates
- Journal of the ACM
, 1979
"... ABSTRACT A sequence of interleaved user transactions in a database system may not be ser:ahzable, t e, equivalent to some sequential execution of the individual transactions Using a simple transaction model, it ~s shown that recognizing the transaction histories that are serlahzable is an NP-complet ..."
Abstract
-
Cited by 246 (0 self)
- Add to MetaCart
an efficient scheduler Finally, it is shown how these results can be extended to far more general transaction models, to transactions with partly interpreted functions, and to distributed database systems KEY WORDS AND PHRASES database management, concurrent update problem, transactions, senahzabdlty
Serializability Of Concurrent Database Updates
, 1979
"... A sequence of interleaved user transactions in a database system may not be 8zis, i.e., equivalent to some sequential execution of the individual transactions. Using a simle transaction model we show that recognizing the transaction histories which are serializable is an NP- complete problem. W ..."
Abstract
- Add to MetaCart
A sequence of interleaved user transactions in a database system may not be 8zis, i.e., equivalent to some sequential execution of the individual transactions. Using a simle transaction model we show that recognizing the transaction histories which are serializable is an NP- complete problem
On optimistic methods for concurrency control
- ACM Transactions on Database Systems
, 1981
"... Most current approaches to concurrency control in database systems rely on locking of data objects as a control mechanism. In this paper, two families of nonlocking concurrency controls are presented. The methods used are “optimistic ” in the sense that they rely mainly on transaction backup as a co ..."
Abstract
-
Cited by 546 (1 self)
- Add to MetaCart
Most current approaches to concurrency control in database systems rely on locking of data objects as a control mechanism. In this paper, two families of nonlocking concurrency controls are presented. The methods used are “optimistic ” in the sense that they rely mainly on transaction backup as a
Distributed Database Systems
"... this article, we discuss the fundamentals of distributed DBMS technology. We address the data distribution and architectural design issues as well as the algorithms that need to be implemented to provide the basic DBMS functions such as query processing, concurrency control, reliability, and replica ..."
Abstract
-
Cited by 588 (26 self)
- Add to MetaCart
this article, we discuss the fundamentals of distributed DBMS technology. We address the data distribution and architectural design issues as well as the algorithms that need to be implemented to provide the basic DBMS functions such as query processing, concurrency control, reliability
Greengenes, a chimera-checked 16S rRNA gene database and workbench compatible with
, 2006
"... Updated information and services can be found at: ..."
Abstract
-
Cited by 492 (25 self)
- Add to MetaCart
Updated information and services can be found at:
A majority consensus approach to concurrency control for multiple copy databases
- ACM Transactions on Database Systems
, 1979
"... A “majority consensus ” algorithm which represents a new solution to the update synchronization problem for multiple copy databases is presented. The algorithm embodies distributed control and can function effectively in the presence of communication and database site outages. The correctness of the ..."
Abstract
-
Cited by 376 (0 self)
- Add to MetaCart
A “majority consensus ” algorithm which represents a new solution to the update synchronization problem for multiple copy databases is presented. The algorithm embodies distributed control and can function effectively in the presence of communication and database site outages. The correctness
On the Difference between Updating a Knowledge Base and Revising it
"... this paper, we argue that no such set of postulates will be adequate for every application. In particular, we make a fundamental distinction between two kinds of modifications to a knowledge base. The first one, update, consists of bringing the knowledge base up to date when the world described by i ..."
Abstract
-
Cited by 473 (8 self)
- Add to MetaCart
by it changes. For example, most database updates are of this variety, e.g. "increase Joe's salary by 5%". Another example is the incorporation into the knowledge base of changes caused in the world by the actions of a robot (Ginsberg and Smith 1987, Winslett 1988, Winslett 1990) . We show
Virtual time
- ACM Transactions on Programming Languages and Systems
, 1985
"... Virtual time is a new paradigm for organizing and synchronizing distributed systems which can be applied to such problems as distributed discrete event simulation and distributed database concur-rency control. Virtual time provides a flexible abstraction of real time in much the same way that virtua ..."
Abstract
-
Cited by 980 (7 self)
- Add to MetaCart
Virtual time is a new paradigm for organizing and synchronizing distributed systems which can be applied to such problems as distributed discrete event simulation and distributed database concur-rency control. Virtual time provides a flexible abstraction of real time in much the same way
R-trees: A Dynamic Index Structure for Spatial Searching
- INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA
, 1984
"... In order to handle spatial data efficiently, as required in computer aided design and geo-data applications, a database system needs an index mechanism that will help it retrieve data items quickly according to their spatial locations However, traditional indexing methods are not well suited to data ..."
Abstract
-
Cited by 2750 (0 self)
- Add to MetaCart
In order to handle spatial data efficiently, as required in computer aided design and geo-data applications, a database system needs an index mechanism that will help it retrieve data items quickly according to their spatial locations However, traditional indexing methods are not well suited
Results 1 - 10
of
9,851
