![]() ![]() ![]() |
![]() |
|
|
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Return to Industrial Sessions 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. Note: References link to DBLP on the Web.
@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. |