Sciweavers

11784 search results - page 185 / 2357
» Interpolation for data structures
Sort
View
DEXA
2000
Springer
147views Database» more  DEXA 2000»
15 years 7 months ago
Lattice-Structured Domains, Imperfect Data and Inductive Queries
The relational model, as proposed by Codd, contained the concept of relations as tables composed of tuples of single valued attributes taken from a domain. In most of the early lit...
Sally Rice, John F. Roddick
GIS
1999
ACM
15 years 7 months ago
Spatio-Temporal Conceptual Models: Data Structures + Space + Time
Nowadays, many applications need data modeling facilities for the description of complex objects with spatial and/or temporal facilities. Responses to such requirements may be fou...
Christine Parent, Stefano Spaccapietra, Esteban Zi...
109
Voted
SPAA
1990
ACM
15 years 7 months ago
Wait-Free Data Structures in the Asynchronous PRAM Model
A wad-free implementation of a data object in shared memory is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execu...
James Aspnes, Maurice Herlihy
LICS
2002
IEEE
15 years 8 months ago
Monadic Queries over Tree-Structured Data
Monadic query languages over trees currently receive considerable interest in the database community, as the problem of selecting nodes from a tree is the most basic and widesprea...
Georg Gottlob, Christoph Koch
VLDB
1998
ACM
153views Database» more  VLDB 1998»
15 years 7 months ago
Small Materialized Aggregates: A Light Weight Index Structure for Data Warehousing
Small Materialized Aggregates (SMAs for short) are considered a highly flexible and versatile alternative for materialized data cubes. The basic idea is to compute many aggregate ...
Guido Moerkotte