Very Large Data Bases: Proceedings, Volume 14IEEE, 1988 - Data structures (Computer science) |
Contents
A Study of Algorithms | 13 |
SplitTransactions for OpenEnded Activities | 26 |
Closed World Database Opened Through Null Values 50 | 50 |
25 other sections not shown
Other editions - View all
Common terms and phrases
algorithm application assume atomic attribute B-tree bit slice block bucket caching component Computer concurrency control consider context copy corresponding cost Data Base Database Systems datatype DBMS deductive databases defined definition deletion denote descriptor distributed DWIM estimate evaluation event Event Calculus example execution expression Figure function graph hash implementation insertion instance interface join method keyterms keywords language Lemma lock logical Management node null object operations parameters path performance PLOP-Hashing POSTGRES predicate problem Proc processing processor PROQUEL pseudotime query optimization query plan record relational database requires result retrieval rules schema version scheme tree semantics serial serializability SIGMOD specific split split phase Stonebraker storage stored strategy structure Superimposed Coding techniques temporal timestamp tion transaction transitive closure tuple updates variables VLDB