ACM Home Page
Please provide us with feedback. Feedback
Semantic assumptions and query evaluation in temporal databases
Full text PdfPdf (1.42 MB)
Source International Conference on Management of Data archive
Proceedings of the 1995 ACM SIGMOD international conference on Management of data table of contents
San Jose, California, United States
Pages: 257 - 268  
Year of Publication: 1995
ISBN:0-89791-731-6
Also published in ...
Authors
Claudio Bettini  Dipartimento di Scienze dell'Informazione, Università degli Studi di Milano, Via Comelico 39/41, 20135 Milano, Italy
X. Sean Wang  Department of Information and Software Systems Engineering, George Mason University, Fairfax, VA
Elisa Bertino  Dipartimento di Scienze dell'Informazione, Università degli Studi di Milano, Via Comelico 39/41, 20135 Milano, Italy
Sushil Jajodia  Department of Information and Software Systems Engineering, George Mason University, Fairfax, VA
Sponsors
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 17,   Citation Count: 7
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/223784.223843
What is a DOI?

ABSTRACT

When querying a temporal database, a user often makes certain semantic assumptions on stored temporal data. This paper formalizes and studies two types of semantic assumptions: point-based and interval-based. The point-based assumptions include those assumptions that use interpolation methods, while the interval-based assumptions include those that involve different temporal types (time granularities). Each assumption is viewed as a way to derive certain implicit data from the explicit data stored in the database. The database system must use all explicit as well as (possibly infinite) implicit data to answer user queries. This paper introduces a new method to facilitate such query evaluations. A user query is translated into a system query such that the answer of this system query over the explicit data is the same as that of the user query over the explicit and the implicit data. The paper gives such a translation procedure and studies the properties (safety in particular) of user queries and system queries.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
AKPT91
J. F. Allen, H. Kautz, R. Pelavin, and . Tenenberg. Reasoning about Plans. Morgan-Kaufman, 1991.
 
BWBJ95
C. Bettini, X. Wang, E. Bertino, and S. J ajodia. Introducing assumptions in temporal databases. Manuscript, 1995. GMU.
CCT94
 
Cho92
 
CI94
CT85
CW83
 
DM87
EMHJ93
 
Sho87
Sno84
SS87
 
Tan87
 
TCG+93
 
Ull88
 
WBBJ94
X. Wang, C. Bettini, A. Brodsky, and S. J ajodia. Logical design for temporal databases with multiple temporal types. Technical Report ISSE-TR-94-111, GMU, 1994.
 
WJL91
 
WJS95

CITED BY  7

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.2 DATABASE MANAGEMENT
      H.2.4 Systems
          Subjects: Query processing

Additional Classification:
  H. Information Systems
  H.2 DATABASE MANAGEMENT
      H.2.1 Logical Design
          Subjects: Data models
      H.2.3 Languages
          Subjects: Query languages
          Nouns: MQL


General Terms:
Algorithms, Languages, Theory

Collaborative Colleagues:
Claudio Bettini: colleagues
X. Sean Wang: colleagues
Elisa Bertino: colleagues
Sushil Jajodia: colleagues