ACM Home Page
Please provide us with feedback. Feedback
Database method schemas and object creation
Full text PdfPdf (1.14 MB)
Source Symposium on Principles of Database Systems archive
Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems table of contents
Washington, D.C., United States
Pages: 265 - 275  
Year of Publication: 1993
ISBN:0-89791-593-3
Authors
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 16,   Citation Count: 4
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/153850.153911
What is a DOI?

ABSTRACT

The expressiveness of various object-oriented languages is investigated with respect to their ability to create new objects. We focus on database method schemas (dms), a model capturing the data manipulation capabilities of a large class of deterministic methods in object-oriented databases. The results clarify the impact of various language constructs on object creation. Several new constructs based on expanded notions of deep equality are introduced. In particular, we provide a tractable construct which yields a language complete with respect to object creation. The new construct is also relevant to query complexity. For example, it allows expressing in polynomial time some queries, like counting, requiring exponential space in dms alone.


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.

AH87
AK89
AKW90
 
AV91a
AV91b
 
AP92
 
B78
F. Bancilhon. On t}he Completeness of Query Languages for Relational Data Bases. In Proc. 7th Symp. on Ma#!hematical Foundations of Computer Science, Lecture Notes in Computer Science 64, 112-123, Springer-Verlag, 1978.
BG2
 
BGAG92
J. Van den Bussche, D. Van Gucht, M. Andries and M. Gyssens. On the Completeness of Object-Creating Query Languages. In Proc. 33rd Symp. on Foundations of Computer Science, 372-379, 1992.
BP91
Ch81
 
CH80
A. Chandra and D. {-Iarel. Computable Queries for Relational Data Bases. Journal of Computer and System Sciences,, 21(2):156-178, Oct. 1980.
 
DV91
 
D93
K. Denninghoff. Database Method Schemas. PhD Thesis, in preparation.
GPVG90a
GPVG90b
HS88
 
KC90
 
KV88


Collaborative Colleagues:
Karl Denninghoff: colleagues
Victor Vianu: colleagues