Comparison of access methods for time-evolving data
B Salzberg, VJ Tsotras - ACM Computing Surveys (CSUR), 1999 - dl.acm.org
This paper compares different indexing techniques proposed for supporting efficient access
to temporal data. The comparison is based on a collection of important performance criteria …
to temporal data. The comparison is based on a collection of important performance criteria …
RT Snodgrass - 1999 - dl.acm.org
Temporal databases deal with time-varying tables containing certain kinds of DATE
columns. Effectively designing, querying, and modifying time-varying tables requires a …
columns. Effectively designing, querying, and modifying time-varying tables requires a …
[BOOK][B] SpecLab: digital aesthetics and projects in speculative computing
J Drucker - 2009 - books.google.com
Nearly a decade ago, Johanna Drucker cofounded the University of Virginia's SpecLab, a
digital humanities laboratory dedicated to risky projects with serious aims. In SpecLab she …
digital humanities laboratory dedicated to risky projects with serious aims. In SpecLab she …
Temporal data management
A wide range of database applications manage time-varying information. Existing database
technology currently provides little support for managing such data. The research area of …
technology currently provides little support for managing such data. The research area of …
[BOOK][B] Handbook of data structures and applications
Although there are many advanced and specialized texts and handbooks on algorithms,
until now there was no book that focused exclusively on the wide variety of data structures …
until now there was no book that focused exclusively on the wide variety of data structures …
A survey of schema versioning issues for database systems
JF Roddick - Information and Software Technology, 1995 - Elsevier
Schema versioning is one of a number of related areas dealing with the same general
problem—that of using multiple heterogeneous schemata for various database related tasks …
problem—that of using multiple heterogeneous schemata for various database related tasks …
Towards historical R-trees
MA Nascimento, JRO Silva - Proceedings of the 1998 ACM symposium …, 1998 - dl.acm.org
ABSTRACT R-trees are the" de facto" reference structures for indexing spatial data, namely
the minumum bounding rectangles (MBRs) of spatial objects. However, R-trees, as currently …
the minumum bounding rectangles (MBRs) of spatial objects. However, R-trees, as currently …