13 citations found. Retrieving documents...
W. Kim, H.T. Chou, and J. Banerjee. Operations and implementation of complex objects. In Proc. 3rd Int. Conf. on Data Engg., pages 626--633, 1987.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Rule Allocation in Distributed Deductive Database Systems - Mohania, Sarda (1994)   (2 citations)  (Correct)

....a modular program in a two processor system. In distributed DBMS [5] the relations of a database can be fragmented in three ways, namely, horizontal, vertical, and mixed fragments. Each fragment is a cluster of data which are predominantly used together by applications. Many object oriented DBMSs [2, 12] have been designed using different clustering schemes which are static in nature. Objects are clustered based on their inter relationships and or their simultaneous access potential. A dynamic reclustering scheme of objects has been discussed in [6] A number of data clustering algorithms have ....

W. Kim, H.T. Chou, and J. Banerjee. Operations and implementation of complex objects. In Proc. 3rd Int. Conf. on Data Engg., pages 626--633, 1987.


Temporal Relations in Geographic Information Systems: A.. - Barrera, Frank, Al-Taha (1991)   (7 citations)  (Correct)

....that, among others, provide constructs for specifying the format of statistical tables, a library of built in aggregate operators, and specially tailored query optimization strategies. ii) The facilities provided in 00 DBMS for the creation, modification, and version maintenance of complex objects [KIM88]. iii) Existing categorizations of temporal propositions, depending on how an assertion s validity propagates from a given time interval to others containing it or contained within it [SHOH88] For example, a proposition is downward hereditary if its validity over an interval implies its validity ....

W. Kim, H.T. Chou, J. Banerjee, "Operations and implementation of complex objects", IEEE transactions on software engineering, 14(7),, pp 985-996, July 1988.


A Comprehension-Based Database Language and Its.. - Kazuhiko Kato Takashi (1990)   (2 citations)  (Correct)

.... (1, 5) The fact that the transitive closure operation can be defined in SPL is important since transitive closure is one of the basic operations to manipulate hierarchical objects which are not supported in conventional database systems and which frequently appear in new database applications [8] [13] Database manipulation form The special forms introduced thus far do not include update operations such as the destructive substitution operation, appearing in almost all procedural languages. Only database data can be changed by database manipulation forms insert, delete and update. Note ....

W. Kim, H. Chou, and J. Banerjee. Operations and implementation of complex objects. IEEE Trans. on Soft. Eng., 14(7):985--996, Jul 1988.


Querying Objects with Complex Static Structure - Savnik, Tari (1998)   (Correct)

....demands for the representation and manipulation of the data in these applications include the needs to represent and query objects having complex composition and or classification structure. In this paper we present the database algebra QAL [20] designed for the manipulation of complex objects [14, 1]. QAL is used as the logical algebra [11] in the query execution system of the Distributed Object Kernel [25] abbr. DOK) which is currently under development. DOK will serve as a platform for the development of applications which involve heterogeneous distributed databases storing business and ....

....id Gamma dept = csd and id Gamma age 25 ) apply( id.class of ) 4.2 Querying complex objects In this section, we present the use of QAL operations for the manipulation of complex objects. The presentation is based on the classification of operations on complex objects defined by Kim et al. in [14]. The following types of query which manipulate complex objects are presented. Suppose that the argument of a query is a set of complex objects. Firstly, the set of complex objects can be filtered by specifying the selection condition on the values of simple and complex attributes of argument ....

[Article contains additional citation context not shown here]

W. Kim, H.-T. Chou, J. Banerjee, Operations and Implementation of Complex Objects, IEEE Trans. on Software Engineering , 14(7), July 1988.


Evaluation of Signature Files as Set Access Facilities in.. - Ishikawa, Kitagawa, Ohbo (1993)   (31 citations)  (Correct)

....costs. Our analysis shows that the bitsliced signature file is a very promising set access facility in OODBs. 1 INTRODUCTION Advanced database application areas, such as computer aided design, office automation, and software engineering, handle complex structured data, namely complex objects [Kim88]. The overall goal of object oriented database system (OODB) researches is to provide efficient complex object management facilities. OODBMSs usually offer data modeling constructs such as the set constructor and the tuple constructor, so that the user can specify structures of complex objects. In ....

W. Kim, H.-T. Chou, and J. Banerjee. "Operations and Implementation of Complex Objects," IEEE Trans. Softw. Eng. 14(7):985--995 July 1988.


QAL: A Query Algebra of Complex Objects - Savnik, Tari (1999)   (Correct)

....and the conceptual schemata. Next, in Section 4.2 the queries used for the manipulation of complex objects are classified depending on the type of the operation they perform. The presented classification is based on the classification of the operations on complex objects presented by Kim et al. in [27]. We demonstrate that QAL operations can express the main types of queries on complex objects. 4.1 Using Conceptual Schemata for Querying Databases Let us first define two general types of queries which will later serve for the classification of queries which use the conceptual schemata. Firstly, ....

....= student assistant.exts. select( id.val = employee peter.val ) 4.2 Querying Complex Objects In this section, we present the use of QAL operations for the manipulation of complex objects. The presentation is based on the classification of operations on complex objects defined by Kim et al. in [27]. The following types of queries which manipulate complex objects are presented in Sections 4.2.1 4.2.4. Firstly, the set of complex objects can be filtered by specifying a selection condition on the values of simple and complex attributes of argument complex objects. The values of complex ....

[Article contains additional citation context not shown here]

W. Kim, H.-T. Chou, J. Banerjee, Operations and Implementation of Complex Objects, IEEE Trans. on Software Engineering, 14(7), July 1988, pp. 985-996.


A Storage Server for the Efficient Support of Complex Objects - Nittel, Dittrich (1996)   (Correct)

.... Page and Buffer Management Physical Data Structures Logical Access Structures Secondary Storage Management Logical Data Structures DBMS Storage System Object Buffer Figure 1: Classical DBMS Architecture Looking at existing work, some proposals have been made for complex object storage support [1, 6, 8, 9, 12, 19, 22]. Some of them provide storage objects that are composed of different field types, e.g. fixedsized fields, variable sized fields, long fields, set valued fields etc. This approach was mainly employed by monolithic non standard DBMS s [8, 12, 22] Due to the large variety of different object ....

....for complex object storage support [1, 6, 8, 9, 12, 19, 22] Some of them provide storage objects that are composed of different field types, e.g. fixedsized fields, variable sized fields, long fields, set valued fields etc. This approach was mainly employed by monolithic non standard DBMS s [8, 12, 22]. Due to the large variety of different object types in nonstandard data models, most of the proposals [1, 6, 9, 19] provide simple, unstructured storage objects, thereby making the storage component highly reusable while still providing the most efficient storage support with respect to the ....

[Article contains additional citation context not shown here]

W. Kim, H.-T. Chou, and J. Banerjee. Operations and Implementation of Complex Objects. In Third International Conference on Data Engineering, Los Angeles, California, pages 626--633. IEEE Computer Society, 1987.


A Framework for Strong Typing and Type Inference in.. - Kemper, Moerkotte   (Correct)

....but the components (attributes, set elements, etc. are untyped, i.e. they may refer to any object. The precursor of this approach in the programming language area is Smalltalk 80 [8] which gave rise to some developments in the database area, e.g. GemStone [4] and to some extent Orion [11]. The two above mentioned classes of object oriented data models cannot guarantee type safety of database operations at compile time. We argue that the lack of type safety in object bases constitutes a much more severe problem than in object oriented programming languages: an object base is a ....

W. Kim, H. T. Chou, and J. Banerjee. Operations and implementation of complex objects. IEEE Trans. Software Eng., 14(7):985--996, Jul 1988.


Model, Language and Implementation Aspects of a Logic-Based.. - Zhu (1989)   (Correct)

....are valuable assets in engineering databases [Kemper87] They showed how an behaviorally object oriented system can be constructed on top of a structurally object oriented system, using a non first normal form relational data model. Other similar work has also been reported in the literature [Bancilhon85, Dittrich86, Ege87, Kim87, Stonebraker86]. More importantly, there have been successful implementations of object oriented database management systems. Several representative systems are GemStone [Maier86, 86a] Ontos [Andrews87] ORION [Banerjee87, 87a] Encore Observer [Zdonik85] and Iris [Derrett85, Fishman87 ] GemStone uses a ....

Kim, W., Chou, H. T. and Banerjee, J., "Operations and Implementation of Complex Objects," Proceedings of 13th International Conference on Very Large Data Bases, 1987.


Clustering in Object Bases - Gerlhof, Kemper, Kilger, Moerkotte (1992)   (3 citations)  (Correct)

....for the hierarchical model [Sch77] Contrary to other data models, it is one of the main characteristics of object oriented databases that the object nets tend to be recursive. Consequently, several clustering strategies have been developed which can also deal with recursive object nets, e.g. [Sta84, CDRS86, KCB88, HK89, BD90, TN91, CH91]. Except for [KCB88, CDRS86, BD90] all these approaches rely on statistical data dynamically collected from former application runs, i.e. monitoring. Thus, they are applicable to object oriented databases but they are not necessarily specifically tailored for those since they ignore the object ....

....data models, it is one of the main characteristics of object oriented databases that the object nets tend to be recursive. Consequently, several clustering strategies have been developed which can also deal with recursive object nets, e.g. Sta84, CDRS86, KCB88, HK89, BD90, TN91, CH91] Except for [KCB88, CDRS86, BD90], all these approaches rely on statistical data dynamically collected from former application runs, i.e. monitoring. Thus, they are applicable to object oriented databases but they are not necessarily specifically tailored for those since they ignore the object types associated behavior as a ....

W. Kim, H. T. Chou, and J. Banerjee. Operations and implementation of complex objects. IEEE Trans. on Software Engineering, 14(7):985--996, Jul 1988.


Integrated Support for Software Reuse in Computer-Aided Software.. - Poulin (1993)   (1 citation)  (Correct)

....Complex objects consist of hierarchical groups of tuples starting with a root tuple that represents the design object, and sets of dependent tuples that define the object. Complex objects can succinctly represent the recursive, non disjoint objects that the relational model cannot easily handle [12], 13] Design data commonly includes recursive data because real world objects often consist of smaller objects which retain many of the characteristics of the entire object. The following examples show how we can represent data modelling abstractions [24] using a tuple format: 1. Aggregation ....

Kim, Won, Hong-Tai Chou and Jay Banerjee, "Operations and Implementation of Complex Objects," Proceedings of the 3rd International Conference on Data Engineering, Los Angeles, CA, 1987, pp. 626-633.


Storage Management for Knowledge Bases - Thodoros Topaloglou (1993)   (3 citations)  (Correct)

....[18] and semantic data models [26] 5] The aggregation relationships suggest the way that the components of objects are structured together. Two techniques have been proposed for the implementation of aggregation in object oriented databases: The use of object identifiers (OIDs) 15] 33] [16], 22] and the use of nested structures [27] 9] 8] The access patterns with regards the temporal knowledge, stored in a knowledge base, define additional requirements for the logical and physical organization of the knowledge base storage. Deductive rules and integrity constraints define ....

W. Kim, H.-T. Chou, and J. Banerjee. Operations and Implementation of Complex Objects. In Int. Conf. on Data Engineering, 626--633, 1987.


Querying Objects with Complex Static Structure - Savnik, Tari (1998)   (Correct)

No context found.

W. Kim, H.-T. Chou, J. Banerjee, Operations and Implementation of Complex Objects, IEEE Trans. on Software Engineering , 14#7#, July 1988.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC