In this paper we consider real-time concurrency control for the nested transaction model. We analyze problems that have pure optimistic and pessimistic approaches. As the solution...
In this paper we discuss the management of semi-structured data, i.e., data that has irregular or dynamically changing structure. We describe components of the Stanford Tsimmis Pr...
Joachim Hammer, Jason McHugh, Hector Garcia-Molina
Efficient evaluation strategies for declarative updates have rarely been investigated. Due to possible dependencies between the resulting database state and the order in which re...
Recent work on client-server data-shipping OODBs has demonstratedthe usefulnessof localdatacachingat clientsites. In addition to data caching, index caching can provide substantia...
A graphical formalized language is proposed for specifying systems of views over database schemas. The language is based on the notion of arrow (mapping) between data schemas and ...
Today, two classes of indexing methods enjoying wide applicability are the Inverted Index and the Superimposed Coding based Signature File (SC-SF). The former is most efficient i...
Dimitrios Dervos, P. Linardis, Yannis Manolopoulos
Computing multiple related group-bys and aggregates is one of the core operations of On-Line Analytical Processing (OLAP) applications. Recently, Gray et al. [GBLP95] proposed the...
Yihong Zhao, Prasad Deshpande, Jeffrey F. Naughton
The Distributed Information Search COmponent (Disco) is a prototype heterogeneous distributed database that accesses underlying data sources. The Disco prototype currently focuses...
We study similarity queries for time series data where similarity is defined in terms of a set of linear transformations on the Fourier series representation of a sequence. We ha...