Sciweavers

ICDE
1991
IEEE
103views Database» more  ICDE 1991»
13 years 11 months ago
On Serializability of Multidatabase Transactions Through Forced Local Conflicts
The maindi culty in enforcing globalserializabilityin a multidatabase environment lies in resolving indirect (transitive) con icts between multidatabase transactions. Indirect con...
Dimitrios Georgakopoulos, Marek Rusinkiewicz, Amit...
ICDE
1991
IEEE
145views Database» more  ICDE 1991»
13 years 11 months ago
DOT: A Spatial Access Method Using Fractals
Existing Database Management Systems (DBMSs) do not handle efficiently multi-dimensional data such as boxes, polygons, or even points in a multi-dimensional space. We examine acc...
Christos Faloutsos, Yi Rong
ICDE
1991
IEEE
175views Database» more  ICDE 1991»
13 years 11 months ago
Constraint-Based Reasoning in Deductive Databases
— Constraints play an important role in the efficient query evaluation in deductive databases. In this paper, constraint-based query evaluation in deductive databases is investi...
Jiawei Han
EDBT
1992
ACM
111views Database» more  EDBT 1992»
13 years 11 months ago
Pipelined Query Processing in the DBGraph Storage Model
The DBGraph storage model, designed for main memory DBMS, ensures both data storage compactness and efficient processing for all database operations. By representing the entire da...
Philippe Pucheral, Jean-Marc Thévenin
DOOD
1991
Springer
107views Database» more  DOOD 1991»
13 years 11 months ago
Non-Determinism in Deductive Databases
This paper examines the problem of adding non-deterministic constructs to a declarative database language based on Horn Clause Logic. We revise a previously proposed approach, the...
Fosca Giannotti, Dino Pedreschi, Domenico Sacc&agr...
DEXA
1991
Springer
87views Database» more  DEXA 1991»
13 years 11 months ago
Building Adaptive Applications using Active Mediators
Tore Risch, Gio Wiederhold
DBPL
1991
Springer
98views Database» more  DBPL 1991»
13 years 11 months ago
Structural Recursion as a Query Language
We propose a programming paradigm that tries to get close to both the semantic simplicity of relational algebra, and the expressive power of unrestricted programming languages. It...
Val Tannen, Peter Buneman, Shamim A. Naqvi
DBPL
1991
Springer
84views Database» more  DBPL 1991»
13 years 11 months ago
Type-safe Linguistic Reflection
David W. Stemple, Ronald Morrison, Malcolm P. Atki...
DBPL
1991
Springer
66views Database» more  DBPL 1991»
13 years 11 months ago
Rationale and Design of BULK
BULK is a very-high-level persistent programming language and environment for prototyping and implementing database applications. BULK provides sets and sequences as primitive typ...
Steve Rozen, Dennis Shasha
DBPL
1991
Springer
91views Database» more  DBPL 1991»
13 years 11 months ago
Bulk Types: Built-In or Add-On?
Florian Matthes, Joachim W. Schmidt