A calculus for complex objects

Bancilhon, François; Khoshafian, Setrag

doi:10.1145/6012.15404

Cited by 118 publications

(25 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Complex objects propose nested relations against normalized ones in the attempt to overcome the restrictions imposed by flat relations. A calculus for complex objects is presented in [3]. A lattice structure is defined on nested objects and operators on these objects are introduced.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Modeling and manipulating the structure of hierarchical schemas for the web

Dalamagas

Meliou

Sellis

2008

Information Sciences

View full text Add to dashboard Cite

Section: Related Workmentioning

confidence: 99%

“…21, the system is built on top of the ICS-FORTH RDFSuite. 3 To this extend, it exploits all RDF management and query APIs offered by RDFSuite. Results are visualized using RDFSViz.…”

Section: 3)mentioning

confidence: 99%

Modeling and manipulating the structure of hierarchical schemas for the web

Dalamagas

Meliou

Sellis

2008

Information Sciences

View full text Add to dashboard Cite

“…1 In the hope of finding QL(B) for which well-definedness is decidable, it is therefore worthwhile to restrict ourselves to "monotone" base operations. For this purpose, we adapt the notion of (unordered) complex object containment [Bancilhon and Khoshafian 1986] to (ordered) stores and values. Intuitively, a store σ is contained in a store σ if σ can be obtained by removing nodes from σ in such a way that if we remove a node, we also remove all of its descendants.…”

Section: Proposition 32 Satisfiability For Ql(b) Reduces To Ill-defmentioning

confidence: 99%

On deciding well-definedness for query languages on trees

Vansummeren

2007

J. ACM

View full text Add to dashboard Cite

The well-definedness problem for a database query language consists of checking, given an expression and an input type, that the expression never yields a runtime error on any input adhering to the input type. In this article, we study the well-definedness problem for query languages on trees that are built from a finite set of partially defined base operations by adding variables, constants, conditionals, let bindings, and iteration. We identify properties of base operations that can make the problem undecidable and give restrictions that are sufficient to ensure decidability. As a direct result, we obtain a large fragment of XQuery for which well-definedness is decidable. ACM Reference Format:Vansummeren, S. 2007. On deciding well-definedness for query languages on trees.

show abstract

“…Some models implement complex objects whose internal structure is visible [6,38,421, while others view objects as instances of abstract data types (ADT) [4, 511. Access to objects that ar'e instances of an ADT is through a public interface. This interface defines the behavior of the object.…”

Section: Query Formalismsmentioning

confidence: 99%

Queries and query processing in object-oriented database systems

Straube¹,

Özsu²

1990

ACM Trans. Inf. Syst.

View full text Add to dashboard Cite

Object-oriented database management systems (OODBMS) combine the data abstraction and computational models of object-oriented programming languages with the query and performance capabilities of database management systems. A concise, formal data model for OODBMS has not been universally accepted, preventing detailed investigation of various system issues such as query processing. We define a data model that captures the essence of classification-based object-oriented systems and formalize concepts such as object identity, inheritance, and methods. The main topic of the paper is the presentation of a query processing methodology complete with an object calculus and a closed object algebra. Query processing issues such as query safety and object calculus to object algebra translation are discussed in detail. The paper concludes with a discussion of equivalence-preserving transformation rules for object algebra expressions.

show abstract

A calculus for complex objects

Cited by 118 publications

References 8 publications

Modeling and manipulating the structure of hierarchical schemas for the web

Modeling and manipulating the structure of hierarchical schemas for the web

On deciding well-definedness for query languages on trees

Queries and query processing in object-oriented database systems

Contact Info

Product

Resources

About