Article

Free access

A polymorphic calculus for views and object sharing (extended abstract)

Authors:

Keishi TajimaAuthors Info & Claims

PODS '94: Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

Pages 255 - 266

https://doi.org/10.1145/182591.182623

Published: 24 May 1994 Publication History

Abstract

We present a typed polymorphic calculus that supports a general mechanism for view definition and object sharing among classes. In this calculus, a class can contain inclusion specifications of objects from other classes. Each such specification consists of a predicate determining the subset of objects to be included and a viewing function under which those included objects are manipulated. Both predicates and viewing functions can be any type consistent programs definable in the polymorphic calculus. Inclusion specifications among classes can be cyclic, allowing mutually recursive class definitions. These features achieve flexible view definitions and wide range of class organizations in a compact and elegant way. Moreover, the calculus provides a suitable set of operations for views and classes so that the programmer can manipulate views and classes just the same way as one deals with ordinary records and sets.

The proposed calculus uniformly integrates views and classes in a polymorphic type system of a database programming language similar to Machiavelli. The calculus has a type inference algorithm that relieves the programmer from complicated type declarations of views and classes. The polymorphic type system of the calculus is also shown to be sound, which guarantees complete static check of type consistency of programs involving classes and views. Through these properties, the programmer can enjoy full advantages of polymorphism and type inference when writing object-oriented database programs.

References

[1]

S. Abiteboul and A. Bonner. Objects and views. In Proc. A CM SIGMOD Conference, pp. 238- 247, 1991.

Digital Library

[2]

M.P. Atkinson, F. Bancilhon, D. DeWitt, K. Dittrick, D. Maier, and S. Zdonik. The object-oriented database system manifesto. In Proceedzngs of the First Deductzve and Object- Oriented Database Conference, Kyoto, Japan, December 1989.

[3]

A. Albano, R. Bergumini, G. Ghelli, and R. Orsini. An object data model with roles. In Proc. VLDB Conference, pp. 39-51, 1993.

Digital Library

[4]

A. Albano, L. Cardelli, and R. Orsini. Galileo: A strongly typed, interactive conceptual language. A CM Transactions on Database Systems, Vol. 10, No. 2, pp. 230-260, 1985.

Digital Library

[5]

S. Abiteboul, G. Lausen, H. Uphoff, and E. Waller. Methods and rules. In Proc. ACM SIGMOD Conference, pp. 32-41, 1993.

Digital Library

[6]

F. Bancilhon, T. Briggs, S. Khoshafian, and P VMduriez. FAD # powerful and simple database language. In Proc. Intl. Conf. on Very Large Data Bases, pp. 97-105, 1988.

Digital Library

[7]

F. Bancilhon, C. Delobel, and P. Kanellakis (eds). Building an OODBMS, the story of 02. Morgan Kaufman, 1992.

[8]

P. Buneman and A. Ohori. A type system that reconcile classes and extents. In 3rd International Workshop on Database Programming Languages, 1991.

Digital Library

[9]

P. Buneman and A. Ohori. Polymorphism and type inference in database programming. Technical report., Universities of Glasgo and Pennsylvania, 1992. To appear in ACM Transaction on Database Systems.

Digital Library

[10]

V. Breazu-Tannen, P. Buneman, and A. Ohori. Data structures and data types in objectoriented databases. IEEE Data Engineemng Bulletin, Special Issue on Theoretzcal Foundation of Object-Oriented Databases, Vol. 14, No. 2, pp. 23-27, 1991.

Digital Library

[11]

T. Barsalou, N. Siambela, A.M. Keller, and G. Wiederhold. Updating relational databases through object-based views. In Proc. A CM SIGMOD Conference, pp. 248-257, 1991.

Digital Library

[12]

R. Connor, A. Dearle, R. Morrison, and F. Brown. Existentially Quantified Types as a Database Viewing Mechanism. In Proc. International Conference on Extended Database Technologies, pp. 301-315, 1990.

Digital Library

[13]

A. Goldberg and D. Robson. Smalltalk-80: the language and #ts #mplementat#on. Addison- Wesley, 1983.

Digital Library

[14]

G. Gottlob, P. Paolini, and R. Zicari. Properties and Update Semantics of Consistent Views. A CM Transact,on on Database Systems, Vol. 13, No. 4, pp. 486-524, Dec. 1988.

Digital Library

[15]

S. Heiler and S. Zdonik. Object Views: Extending the Vision. In Proc. IEEE Data Engineering, pp. 86-93, 1990.

Digital Library

[16]

L.A. Jategaonkar and 3.C. Mitchell. ML with extended pattern matching and subtypes. In Proc. A CM Conference on LISP and Functional Programming, pp. 198-211, Snowbird, Utah, July 1988.

Digital Library

[17]

M. Kifer, G. Lausen, and J. Wu. Logical Foundations of Object-Oriented and Frame- Based Languages. Technical report 90/14, State University of New York at Stony Brook, 1990.

Digital Library

[18]

R. Milner. A theory of type polymorphism in programming. Journal of Computer and System Sczences, Vol. 17, pp. 348-375, 1978.

[19]

A. Ohori and P. Buneman. Type inference in a database programming language. In P roc. A CM Conference on LISP and Functional Programm,ng, pp. 174-183, Snowbird, Utah, July 1988.

Digital Library

[20]

A. Ohori and P. Buneman. Static type inference for parametric classes. In Proceed, ngs of A CM OOPSLA Conference, pp. 445-456, New Orleans, Louisiana, October 1989.

Digital Library

[21]

A. Ohori, P. Buneman, and V. Breazu-Tannen. Database programming in Machiavelli- a polymorphic language with static type inference. In Proceedings of the A CM SIGMOD conference, pp. 46-57, Portland, Oregon, May- June 1989.

Digital Library

[22]

A Ohori. A compilation method for ML-style polymorphic record calculi. In Proceedings of A CM Symposium on Pmnciples of Programming Languages, pp. 154-165, 1992.

Digital Library

[23]

D. Remy . Typechecking records and variants in a natural extension of ML. In Proceedings of A CM Symposium on Pmnczples of Programmzng Languages, pp. 242-249, 1989.

Digital Library

[24]

J. Richardson and P. Schwarz. Aspects: extending objects to support multiple, independent roles. In Proc. A CM SIGMOD Conference, pp. 298-307, 1991.

Digital Library

[25]

M. H. Scholl, C. Laasch, and M. Tresch. Updatable views in object-oriented databases. In Deductwe and Object-Oriented Databases, number 566 in LNCS, pp. 189-207. Springer- Verlag, Dec. 1991.

[26]

K. T#jima. A study on an object-oriented database system supporting multi-schema facilities. Master's thesis, The Graduate School of University of Tokyo, 1993.

[27]

K. Tanaka, Y. Yoshikawa, and K. Ishikawa. Schema virtualization in object-oriented databases. In Proc. IEEE Data Engineemng Conference, pp. 23-30, 1988.

Digital Library

[28]

M. Wand. Complete type inference for simple objects. In Proceed,ngs of the Second Annual Symposium on Logic zn Computer Sc,ence, pp. 37-44, Ithaca, New York, June 1987.

[29]

G. Wiederhold. Views, Objects, and Databases. In IEEE Computer, Vol. 19, No. 12, pp. 37-44, 1986.

Digital Library

Cited By

Foster JGreenwald MMoore JPierce BSchmitt A(2015)POPL 2005ACM SIGPLAN Notices10.1145/2854695.285470050:8S(49-62)Online publication date: 4-Dec-2015
https://dl.acm.org/doi/10.1145/2854695.2854700
Bachtarzi CBenchikha F(2012)Ontology-Based Database Multi-representation Using Viewpoints and ViewsNetworked Digital Technologies10.1007/978-3-642-30567-2_11(123-135)Online publication date: 2012
https://doi.org/10.1007/978-3-642-30567-2_11
Hu ZMu STakeichi M(2008)A programmable editor for developing structured documents based on bidirectional transformationsHigher-Order and Symbolic Computation10.1007/s10990-008-9025-521:1-2(89-118)Online publication date: 1-Jun-2008
https://dl.acm.org/doi/10.1007/s10990-008-9025-5
Show More Cited By

Index Terms

A polymorphic calculus for views and object sharing (extended abstract)

Recommendations

Polymorphic type inference and abstract data types
A Polymorphic Environment Calculus and its Type-Inference Algorithm

The polymorphic environment calculus is a polymorphic lambda calculus which enables us to treat environments as first-class citizens. In the calculus, environments are formalized as explicit substitutions, and the substitutions are included in the set ...
Polymorphic type inference and abstract data types

Many statically typed programming languages provide an abstract data type construct, such as the module in Modula-2. However, in most of these languages, implementations of abstract data types are not first-class values. Thus, they cannot be assigned to ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PODS '94: Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

May 1994

313 pages

ISBN:0897916425

DOI:10.1145/182591

Chairman:
Victor Vianu
Univ. of California at San Diego, La Jolla

Copyright © 1994 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 24 May 1994

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGMOD/PODS94

Sponsor:

SIGMOD/PODS94: Joint ACM SIGMOD International Conference on Management of Data and ACM SIGMOD & ACM Symposium Principles of Database Systems

May 24 - 27, 1994

Minnesota, Minneapolis, USA

Acceptance Rates

PODS '94 Paper Acceptance Rate 28 of 117 submissions, 24%;

Overall Acceptance Rate 642 of 2,707 submissions, 24%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

15
Total Citations
View Citations
265
Total Downloads

Downloads (Last 12 months)19
Downloads (Last 6 weeks)4

Reflects downloads up to 06 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Foster JGreenwald MMoore JPierce BSchmitt A(2015)POPL 2005ACM SIGPLAN Notices10.1145/2854695.285470050:8S(49-62)Online publication date: 4-Dec-2015
https://dl.acm.org/doi/10.1145/2854695.2854700
Bachtarzi CBenchikha F(2012)Ontology-Based Database Multi-representation Using Viewpoints and ViewsNetworked Digital Technologies10.1007/978-3-642-30567-2_11(123-135)Online publication date: 2012
https://doi.org/10.1007/978-3-642-30567-2_11
Hu ZMu STakeichi M(2008)A programmable editor for developing structured documents based on bidirectional transformationsHigher-Order and Symbolic Computation10.1007/s10990-008-9025-521:1-2(89-118)Online publication date: 1-Jun-2008
https://dl.acm.org/doi/10.1007/s10990-008-9025-5
Foster JGreenwald MMoore JPierce BSchmitt A(2007)Combinators for bidirectional tree transformationsACM Transactions on Programming Languages and Systems10.1145/1232420.123242429:3(17-es)Online publication date: 1-May-2007
https://dl.acm.org/doi/10.1145/1232420.1232424
Sato HAritsugi M(2007)A virtual type for a multiple‐type object and its implementationSystems and Computers in Japan10.1002/scj.2078138:11(25-35)Online publication date: 26-Jul-2007
https://doi.org/10.1002/scj.20781
Sato HAritsugi M(2006)Extended virtual type for a multiple-type object with repeating typesProceedings of the 10th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part II10.1007/11893004_154(1216-1223)Online publication date: 9-Oct-2006
https://dl.acm.org/doi/10.1007/11893004_154
Holdermans SJeuring JLöh ARodriguez A(2006)Generic views on data typesProceedings of the 8th international conference on Mathematics of Program Construction10.1007/11783596_14(209-234)Online publication date: 3-Jul-2006
https://dl.acm.org/doi/10.1007/11783596_14
Foster JGreenwald MMoore JPierce BSchmitt A(2005)Combinators for bi-directional tree transformationsACM SIGPLAN Notices10.1145/1047659.104032540:1(233-246)Online publication date: 12-Jan-2005
https://dl.acm.org/doi/10.1145/1047659.1040325
Foster JGreenwald MMoore JPierce BSchmitt APalsberg JAbadi M(2005)Combinators for bi-directional tree transformationsProceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/1040305.1040325(233-246)Online publication date: 12-Jan-2005
https://dl.acm.org/doi/10.1145/1040305.1040325
Hu ZMu STakeichi MHeintze NSestoft P(2004)A programmable editor for developing structured documents based on bidirectional transformationsProceedings of the 2004 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation10.1145/1014007.1014025(178-189)Online publication date: 24-Aug-2004
https://dl.acm.org/doi/10.1145/1014007.1014025
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents