Welcome to D
SIGMOD'00
 = SIGMOD'00 We
 = Plenary Talk
<<< = SIGMOD'00 Pa>>>
PODS'00
SIGMOD Recor
CIKM 2000/CI
COMAD 2000
Data Enginee
DL 2000
DPDJ
EDBT 2000
Hypertext 20
ICDE 2000
KDD 2000
KDD Explorat
KRDB 2000
SBBD 2000
SIGIR 2000
SIGIR Forum
SSDBM 2000
TODS
VLDB'00
VLDBJ

Benchmarking Queries over Trees: Learning the Hard Truth the Hard Way


Fanny Wattez, Sophie Cluet, Véronique Benzaken, Guy Ferran, and Christian Fiegel

  View Paper (PDF)  

Return to Industrial Sessions


Abstract

Hierarchical and graph structures are very popular nowadays, thanks to XML and object-relational systems that broadened their range of applications. They can be access in two fashions, depending on the applications: follow links from node to node (e.g., DOM-like [5]) or use associative accesses. A benchmark we ran on the O2 system[1] showed, among other interesting things, that focusing on one kind of access may lead to overlooking the other, needlessly handicaping its performance.


References


Note: References link to DBLP on the Web.

[1]
Ardent Software. http://www.ardentsoftware.fr
[2]
R. G. G. Cattell (Ed.): The Object Database Standard: ODMG 2.0. Morgan Kaufmann 1997
[3]
Sophie Cluet : Designing OQL: Allowing Objects to be Queried. Information Systems 23(5) : 279-305(1998)
[4]
Sophie Cluet , Claude Delobel , Jérôme Siméon , Katarzyna Smaga : Your Mediators Need Data Conversion! SIGMOD Conference 1998 : 177-188
[5]
...
[6]
Jim Gray (Ed.): The Benchmark Handbook for Database and Transaction Systems (2nd Edition). Morgan Kaufmann 1993, ISBN 1-55860-292-5
Contents
[7]
Eugene J. Shekita , Michael J. Carey : A Performance Evaluation of Pointer-Based Joins. SIGMOD Conference 1990 : 300-311
[8]
...

BIBTEX


@inproceedings{DBLP:conf/sigmod/WattezCBFF00,
  author    = {Fanny Wattez and
                Sophie Cluet and
                V{\'e}ronique Benzaken and
                Guy Ferran and
                Christian Fiegel},
   editor    = {Weidong Chen and
                Jeffrey F. Naughton and
                Philip A. Bernstein},
   title     = {Benchmarking Queries over Trees: Learning the Hard Truth the
                Hard Way},
   booktitle = {Proceedings of the 2000 ACM SIGMOD International Conference on
                Management of Data, May 16-18, 2000, Dallas, Texas, USA},
   journal   = {SIGMOD Record},
   publisher = {ACM},
   volume    = {29},
   number    = {2},
   year      = {2000},
   isbn      = {1-58113-218-2},
   pages     = {510-511},
   crossref  = {DBLP:conf/sigmod/2000},
   bibsource = {DBLP, http://dblp.uni-trier.de} } },




DiSC'01 Copyright ©2002 ACM Inc.