Hierarchical query execution in a parallel object-oriented database system

Bassiliades, Nick; Vlahavas, Ioannis

doi:10.1016/0167-8191(96)00031-2

Cited by 5 publications

(2 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The join costs become very high when the relation is vertically partitioned and the queries involve joins of many partitions. Similarly, for main memory databases such as PRACTIC [7], the high join costs make vertical partitioning unsuitable. Several fundamental issues related to partitioning an ODBSs have been reported in [5].…”

Section: It Reduces the Amount Of Irrelevant Data Accessed Bymentioning

confidence: 99%

See 1 more Smart Citation

An overview of vertical partitioning in object oriented databases

Chinchwadkar

Goh

1999

The Computer Journal

View full text Add to dashboard Cite

In this paper, some interesting issues related to vertical partitioning in object oriented database systems are presented. A review of existing research is given with an identification of some open problems. A taxonomy of various possible partitioning schemes and a unified view of the vertical partitioning problem are also presented. Existing vertical partitioning algorithms have been studied for their use in both parallel and distributed object-oriented databases.

show abstract

Section: It Reduces the Amount Of Irrelevant Data Accessed Bymentioning

confidence: 99%

“…This makes horizontal partitioning more scalable than vertical partitioning. Hence the former is more suitable for applications such as decision support systems and the latter more useful for on-line transaction processing (OLTP) systems where high transaction throughput is desirable by virtue of increased data availability [7].…”

Section: Introductionmentioning

confidence: 99%

An overview of vertical partitioning in object oriented databases

Chinchwadkar

Goh

1999

The Computer Journal

View full text Add to dashboard Cite

show abstract

Improved Parallel Algorithms for Path Expression Query Processing of Semi-Structured Data

Sun

Wong

2003

Cooperative Internet Computing

View full text Add to dashboard Cite

On Parallel Join Processing in Object-Relational Database Systems

Märtens

Rahm

2001

Informatik Aktuell

View full text Add to dashboard Cite

Abstract. So far only few performance studies on parallel object-relational database systems are available. In particular, the relative performance of relational vs. reference-based join processing in a parallel environment has not been investigated sufficiently. We present a performance study based on the BUCKY benchmark to compare parallel join processing using reference attributes with relational hash-and merge-join algorithms. In addition, we propose a data allocation scheme especially suited for object hierarchies and set-valued attributes.

show abstract

Hierarchical query execution in a parallel object-oriented database system

Cited by 5 publications

References 14 publications

An overview of vertical partitioning in object oriented databases

An overview of vertical partitioning in object oriented databases

Improved Parallel Algorithms for Path Expression Query Processing of Semi-Structured Data

On Parallel Join Processing in Object-Relational Database Systems

Contact Info

Product

Resources

About