article

PSE: An Object-Oriented Representation for Modeling and Managing Part-of Relationships

Author:

Marko JunkkariAuthors Info & Claims

Journal of Intelligent Information Systems, Volume 25, Issue 2

Pages 131 - 157

https://doi.org/10.1007/s10844-005-0860-0

Published: 01 September 2005 Publication History

Abstract

Part-of relationships are needed to model structures of composite objects. Especially, composite objects, known as physical assemblies, are very popular in several applications. The existing object-oriented representations of physical assemblies and query languages based on them have several disadvantages. For example, they suppose that the user knows the structure of a physical assembly completely. This is not a realistic requirement in those cases where a physical assembly consists of a huge number of parts. Likewise the user has in them to control traversals of physical assemblies, i.e. they have a low degree of declarativity. Further, they do not support intensional and combined extensional-intensional queries which would be necessary in an advanced manipulation of physical assemblies. We develop the PSE (Part-of Structure Element) representation for removing the above disadvantages. The PSE representation is a set theoretical and constructor-oriented representation for physical assemblies and it can be used in the implementation based on both the object-oriented and deductive object-oriented database (DOOD) paradigms.

References

[1]

Abiteboul, S., Cluet, S., Christopbides, V., Milo, T., Moerkotte, G., and Siméon J. (1997). Querying Documents in Object Databases. International Journal on Digital Libraries, 1, 5-19.]]

[2]

Artale, A., Franconi, E., Guarino, N., and Pazzi, L. (1996). Part-Whole Relations in Object-Centered Systems: An Overview. Data and Knowledge Engineering, 20, 347-383.]]

Digital Library

[3]

Bancilhon, F. and Khoshafian, S. (1986). A Calculus for Complex Objects. In Proc of the 5th ACM Symposium on Principles of Database Systems (pp. 53-59). Cambridge, MA: ACM Press Massachusetts.]]

Digital Library

[4]

Barbier, F., Henderson-Sellers, B., Opdahl, A. L., and Gogolla, M. (2000). The Whole-Part Relationship in the Unified Modeling Language: A New Approach. In K. Siau and T. Halpin (Eds.), Unified Modeling Language: Systems Analysis, Design, and Development Issues (pp. 1-20). Hershey, PA: Ideaa Group Publishing.]]

Digital Library

[5]

Bertino, E. and Guerrini, G. (1998). Extending the ODMG Object Model with Composite Objects. In Proc. of the ACM OOPSLA'98 (pp. 259-270). Vancouver, British Columbia: ACM Press.]]

Digital Library

[6]

den Bussche, J. V. and Vossen, G. (1993). An Extension of Path Expressions to Simplify Navigation in Object-Oriented Queries. In Proc. 3rd Int. Conf. on Deductive and Object-Oriented Databases, LNCS 760, (pp. 267- 282). Phoenix, AZ, USA: Springer-Verlag.]]

[7]

Cattell, R. G. G. and Barry, D. K. (Eds.) (2000). The Object Data Standard: ODMG 3.0. Morgan Kaufmann.]]

Digital Library

[8]

Civello, F. (1993). Roles for Composite Objects in Object-Oriented Analysis and Design. In Proc. of the ACM OOPSLA'93 (pp. 376-393). WA: ACM Press.]]

Digital Library

[9]

Cluet, S. (1998). Designing OQL: Allowing Objects to Be Queried. Information Systems, 23, 279-305.]]

Digital Library

[10]

Dar, S. and Agrawal, R. (1993). Extending SQL with Generalized Transitive Closure. IEEE Trans. Knowledge and Data Engineering, 5, 799-812.]]

Digital Library

[11]

Halper, M., Geller, J., Perl, Y., and Klas, W. (1994). Integrating a Part Relationships into an Open OODB System Using Metaclasses. Proc. of the 3rd Int. Conf. on Information and Knowledge Management (pp. 10-17). Gaithersburg, MD: ACM Press.]]

Digital Library

[12]

Halper, M., Geller, J., and Perl, Y. (1998). An OODB Part-Whole Model: Semantics, Notation and Implementation, Data aud Knowledge Engineering, 27, 59-95.]]

Digital Library

[13]

Hua, K. and Tripathy, C. (1994). Objects Skeletons: An Efficient Navigation Structure for Object-Oriented Database Systems. In Proc. of the 10th Int. Conf. on Data Engineering (pp. 508-517). Houston, TE: IEEE Computer Society.]]

Digital Library

[14]

Järvelin, K. and Niemi, T. (1999). Integration of Complex Objects and Transitive Relationships for Information Retrieval. Information Processing and Management, 35, 655-678.]]

Digital Library

[15]

Kifer, M., Kim, W., and Sagiv, Y. (1992). Querying Object-Oriented Databases. Proc. of the 1992 ACM SIGMOD Int. Conf. on Management of Data (pp. 393-402). San Diego, CA, USA: ACM Press.]]

Digital Library

[16]

Kim, W., Banerjee, J., Chou, H. T., Garza, J. F., and Woelk, D. (1987). Composite Object Support in an Object-Oriented Database System. In Proc. Object-Oriented Prog. Syst., Lang. and App. (pp. 118-125). Orlando, Florida, USA: ACM Press.]]

Digital Library

[17]

Lambrix, P. and Padgham, L. (2000). Conceptual Modeling in a Document Management Environment Using Part-of Reasoning in Description Logics. Data and Knowledge Engineering, 32, 51-86.]]

Digital Library

[18]

Lee, W-C. and Lee, D. (1998). Path Dictionary: A New Access Method for Query Processing in Object-Oriented Databases, IEEE Trans. Knowledge and Data Engineering. 10, 371-388.]]

Digital Library

[19]

Li, Q. and Lochovsky, F. (1998). ADOME: An Advanced Object Modeling Environment. IEEE Trans. Knowledge and Data Engineering, 10, 255-275.]]

Digital Library

[20]

Liu, M. (1999). Deductive Database Languages: Problems and Solutions. ACM Computing Surveys, 31, 27-62.]]

Digital Library

[21]

Moss, C. (1994). Prolog++ the Power of Object-Oriented and Logic Programming, Addison-Wesley.]]

Digital Library

[22]

Motro, A. (1994). Intensional Answers to Database Queries. IEEE Trans. Knowledge and Data Engineering, 6, 444-454.]]

Digital Library

[23]

Motschnig-Pitrik, R. and Kaasböll, J. (1999). Part Whole Relationship Categories and Their Application in Object-Oriented Analysis. IEEE Trans. Knowledge and Data Engineering, 11, 779-797.]]

Digital Library

[24]

Niemi, T., Christensen, M., and Järvelin, K. (2000). Query Language Approach Based on Deductive Object-Oriented Database Paradigm. Information and Software Technology, 42, 777-792.]]

[25]

Niemi, T, Junkkari, M., and Järvelin, K. (2002). Relational Deductive Object-Oriented Modeling (R-DOOM) Approach for Finding, Representing and Integrating Application-Specific Concepts. International Journal of Software and Knowledge Engineering, 12, 415-451.]]

[26]

Niemi, T., Junkkari, M., Järvelin, K., and Viita, S. (2004). Advanced Query Language for Manipulating Complex Entities. Information Processing & Management, 40, 869-889.]]

Digital Library

[27]

Pazzi, L. (1999). Implicit Versus Explicit Characterization of Complex Entities and Events. Data and Knowledge Engineering, 31, 115-134.]]

Digital Library

[28]

Renguo, X., Dillon, T. S., Rahayu, W., Chang, E., and Gorla. N. (2000). An Indexing Structure for Aggregation Relationship in OODB. In Proc. of the Int. Conf. and Workshop on Database and Expert Systems Applications (pp. 21-30). London, UK: Springer.]]

Digital Library

[29]

van de Riet, R. P. (1998). Complex Objects: Theory and Practice from a Data- and Knowledge Engineering Perspective, as Seen in and from Yellowstone Park. Data and Knowledge Engineering, 25, 217-238.]]

Digital Library

[30]

Roth, M. A., Korth, H. F., and Silberschatz, A. (1988). Extended Algebra and Calculus for Nested Relational Databases. ACM Trans. Database Systems, 13, 389-417.]]

Digital Library

[31]

Rousset, M-C. and Hors, P. (1996). Modeling and Verifying Complex Objects: A Declarative Approach Based on Description Logics. Proc. of the 12th European Conf. on Artif. Intell (pp. 329-332). Budapest, Hungary: John Wiley and Sons.]]

[32]

Rumbaugh, J., Blaha, M., Premerlani, W., Eddy, F, and Lorensen, W. (1991). Object-Oriented Modeling and Design. Prentice Hall.]]

Digital Library

[33]

Rumbaugh, J., Jacobson, I., and Booch, G. (1999). The Unified Modeling Language Reference Manual. Addison-Wesley.]]

Digital Library

[34]

Savnik, I., Tari, Z., and Mohorič, T. (1999). QAL: A Query Algebra of Complex Objects. Data and Knowledge Engineering, 30, 57-94.]]

[35]

Ullman, J. D. (1988). Principles of Database and Knowledge-Base Systems, Vol I, Computer Science Press.]]

Digital Library

[36]

Urtado, C. and Oussalah, C. (1998). Complex Entity Versioning at Two Granularity Levels, Information Systems, 23, 197-216.]]

Digital Library

[37]

Wand, Y., Storey, V. C., and Weber, R. (1999). An Ontological Analysis of the Relationship Construct in Conceptual Modeling, ACM Trans. Database Systems, 24, 494-528.]]

Digital Library

[38]

Winston, M., Chaffin, R., and Hermann, D. (1987). A Taxonomy of Part-Whole Relations. Cognitive Science, 11, 417-444.]]

Cited By

Junkkari MVainio JIltanen KArvola PKari HKekäläinen J(2016)Path Expressions in SQLJournal of Database Management10.5555/3078282.307828327:3(1-22)Online publication date: 1-Jul-2016
https://dl.acm.org/doi/10.5555/3078282.3078283
Arvola PJunkkari MKekäläinen JHerzog OSchek HFuhr NChowdhury ATeiken W(2005)Generalized contextualization method for XML information retrievalProceedings of the 14th ACM international conference on Information and knowledge management10.1145/1099554.1099561(20-27)Online publication date: 31-Oct-2005
https://dl.acm.org/doi/10.1145/1099554.1099561
Arvola PKekäläinen JJunkkari M(2005)Query evaluation with structural indicesProceedings of the 4th international conference on Initiative for the Evaluation of XML Retrieval10.1007/978-3-540-34963-1_10(134-145)Online publication date: 28-Nov-2005
https://dl.acm.org/doi/10.1007/978-3-540-34963-1_10
Show More Cited By

Index Terms

Recommendations

PSE: explaining program failures via postmortem static analysis

In this paper, we describe PSE (Postmortem Symbolic Evaluation), a static analysis algorithm that can be used by programmers to diagnose software failures. The algorithm requires minimal information about a failure, namely its kind (e.g. NULL ...
PSE: explaining program failures via postmortem static analysis
SIGSOFT '04/FSE-12: Proceedings of the 12th ACM SIGSOFT twelfth international symposium on Foundations of software engineering

In this paper, we describe PSE (Postmortem Symbolic Evaluation), a static analysis algorithm that can be used by programmers to diagnose software failures. The algorithm requires minimal information about a failure, namely its kind (e.g. NULL ...
Using graphics to support the teaching of fundamental object-oriented principles in CS1
OOPSLA '03: Companion of the 18th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications

Teaching object-oriented programming in CS1 is hard. Keeping the attention of CS1 students is perhaps even harder. In our experience the former can be done successfully with very satisfying results by focusing on the fundamental principles of object-...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Journal of Intelligent Information Systems

Journal of Intelligent Information Systems Volume 25, Issue 2

September 2005

110 pages

ISSN:0925-9902

Issue’s Table of Contents

Copyright © Copyright © 2005 Springer Science + Business Media, Inc.

Publisher

Kluwer Academic Publishers

United States

Publication History

Published: 01 September 2005

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 28 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Junkkari MVainio JIltanen KArvola PKari HKekäläinen J(2016)Path Expressions in SQLJournal of Database Management10.5555/3078282.307828327:3(1-22)Online publication date: 1-Jul-2016
https://dl.acm.org/doi/10.5555/3078282.3078283
Arvola PJunkkari MKekäläinen JHerzog OSchek HFuhr NChowdhury ATeiken W(2005)Generalized contextualization method for XML information retrievalProceedings of the 14th ACM international conference on Information and knowledge management10.1145/1099554.1099561(20-27)Online publication date: 31-Oct-2005
https://dl.acm.org/doi/10.1145/1099554.1099561
Arvola PKekäläinen JJunkkari M(2005)Query evaluation with structural indicesProceedings of the 4th international conference on Initiative for the Evaluation of XML Retrieval10.1007/978-3-540-34963-1_10(134-145)Online publication date: 28-Nov-2005
https://dl.acm.org/doi/10.1007/978-3-540-34963-1_10
Kekäläinen JJunkkari MArvola PAalto T(2004)TRIX 2004Proceedings of the Third international conference on Initiative for the Evaluation of XML Retrieval10.1007/11424550_11(127-139)Online publication date: 6-Dec-2004
https://dl.acm.org/doi/10.1007/11424550_11

View Options

View options

Figures

Tables

Media

View Issue’s Table of Contents