An Effective Data Placement Strategy for XML Documents

@inproceedings{Zhu2001AnED,
  title={An Effective Data Placement Strategy for XML Documents},
  author={Yuanling Zhu and Kevin L{\"u}},
  booktitle={BNCOD},
  year={2001}
}
As XML is increasingly being used in Web applications, new technologies need to be investigated for processing XML documents with high performance. Parallelism is a promising solution for structured document processing and data placement is a major factor for system performance improvement in parallel processing. This paper describes an effective XML document data placement strategy. The new strategy is based on a multilevel graph partitioning algorithm with the consideration of the unique… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-5 OF 5 CITATIONS

An XML Data Placement Strategy for Distributed XML Storage and Parallel Query

  • Jing Zhang, Bo Lang, Yawei Duan
  • Computer Science
  • 2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies
  • 2011
VIEW 1 EXCERPT
CITES METHODS

Storage and Access Control Issues for XML Documents

Data placement and query processing based on RPE parallelisms

  • Yaxin Yu, Guoren Wang, +3 authors Nan Tang
  • Computer Science
  • Proceedings 27th Annual International Computer Software and Applications Conference. COMPAC 2003
  • 2003
VIEW 1 EXCERPT
CITES METHODS

Parallel processing XML documents

VIEW 3 EXCERPTS
CITES METHODS & BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-10 OF 16 REFERENCES

A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs

VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

An updated Survey of XML Business Vocabularies, http://www.xml.com/lpt/a/2000/8/02/ebiz/extensible.html

  • Alan Kotok
  • 2000
VIEW 1 EXCERPT

and vipin Kumar , A Fast and High Quality Multilevel Scheme for Partitioning Irregular graphs

  • George Karypis
  • SIAM Journal on Scientific Computing
  • 2000

Object Placement in Parallel OODBMS

VIEW 2 EXCERPTS

Querying Semistructured Data Based On Schema Matching

VIEW 2 EXCERPTS

Fast and effective algorithms for graph partitioning and sparse-matrix ordering

  • Anshul Gupta
  • Computer Science
  • IBM Journal of Research and Development
  • 1997
VIEW 2 EXCERPTS