research-article

Distributed XML design

Authors:

Serge Abiteboul,

Marco MannaAuthors Info & Claims

PODS '09: Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

Pages 247 - 258

https://doi.org/10.1145/1559795.1559833

Published: 29 June 2009 Publication History

Abstract

A distributed XML document is an XML document that spans several machines or Web repositories. We assume that a distribution design of the document tree is given, providing an XML tree some of whose leaves are "docking points", to which XML subtrees can be attached. These subtrees may be provided and controlled by peers at remote locations, or may correspond to the result of function calls, e.g., Web services. If a global type τ, e.g. a DTD, is specified for a distributed document T, it would be most desirable to be able to break this type into a collection of local types, called a local typing, such that the document satisfies τ if and only if each peer (or function) satisfies its local type. In this paper we lay out the fundamentals of a theory of local typing and provide formal definitions of three main variants of locality: local typing, maximal local typing, and perfect typing, the latter being the most desirable. We study the following relevant decision problems: (i) given a typing for a design, determine whether it is local, maximal local, or perfect; (ii) given a design, establish whether a (maximal) local, or perfect typing does exist. For some of these problems we provide tight complexity bounds (polynomial space), while for the others we show exponential upper bounds. A main contribution is a polynomial-space algorithm for computing a perfect typing in this context, if it exists.

References

[1]

S. Abiteboul, O. Benjelloun, and T. Milo. The Active XML project: an overview. The VLDB Journal, 17(5):1019--1040, 2008.

Digital Library

[2]

S. Abiteboul, A. Bonifati, G. Cobéna, I. Manolescu, and T. Milo. Dynamic XML documents with distribution and replication. In SIGMOD '03: Proceedings of the 2003 ACM SIGMOD international conference on Management of data, pages 527--538, 2003.

Digital Library

[3]

S. Abiteboul, I. Manolescu, and E. Taropa. A framework for distributed XML data management. In Y. E. Ioannidis, M. H. Scholl, J. W. Schmidt, F. Matthes, M. Hatzopoulos, K. Bohm, A. Kemper, T. Grust, and C. Bohm, editors, EDBT, volume 3896 of Lecture Notes in Computer Science, pages 1049--1058. Springer, 2006.

Digital Library

[4]

S. Abiteboul, T. Milo, and O. Benjelloun. Regular rewriting of Active XML and unambiguity. In Symposium on Principles of database systems, 2005.

Digital Library

[5]

J.-M. Bremer and M. Gertz. On distributing XML repositories. In V. Christophides and J. Freire, editors, WebDB, pages 73--78, 2003.

[6]

S. Ceri, P. Fraternali, and A. Bongio. Web modeling language (WebML): a modeling language for designing web sites. Comput. Netw., 33(1-6):137--157, 2000.

Digital Library

[7]

S. Ceri, B. Pernici, and G. Wiederhold. An overview of research in the design of distributed databases. IEEE Database Eng. Bull., 7(4):46--51, 1984.

[8]

J. Clark and M. Murata. RELAX NG Specification. OASIS, 1 edition, December 2001.

[9]

G. Ghelli, D. Colazzo, and C. Sartiani. Efficient inclusion for a class of XML types with interleaving and counting. In M. Arenas and M. I. Schwartzbach, editors, DBPL, volume 4797 of Lecture Notes in Computer Science, pages 231--245. Springer, 2007.

Digital Library

[10]

P. Grosso and D. Veillard. XML fragment interchange. Internet Publication, Feb 2001. W3C Candidate Recommendation 12 February 2001.

[11]

C. Hagenah and A. Muscholl. Computing epsilon-free NFA from regular expressions in o(n log2(n)) time. In MFCS '98: Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science, pages 277--285, London, UK, 1998. Springer-Verlag.

Digital Library

[12]

L. O. Hernandez and M. Pegah. WebDAV: what it is, what it does, why you need it. In SIGUCCS '03: Proceedings of the 31st annual ACM SIGUCCS conference on User services, pages 249--254, New York, NY, USA, 2003. ACM.

Digital Library

[13]

M. Holzer and M. Kutrib. State complexity of basic operations on nondeterministic finite automata. In J.-M. Champarnaud and D. Maurel, editors, CIAA, volume 2608 of Lecture Notes in Computer Science, pages 148--157. Springer, 2002.

Digital Library

[14]

J. Hromkovic, S. Seibert, and T. Wilke. Translating regular expressions into small epsilon-free nondeterministic finite automata. In STACS '97: Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science, pages 55--66, London, UK, 1997. Springer-Verlag.

Digital Library

[15]

H. V. Jagadish, L. V. S. Lakshmanan, T. Milo, D. Srivastava, and D. Vista. Querying network directories. SIGMOD Rec., 28(2):133--144, 1999.

Digital Library

[16]

W. Martens, F. Neven, and T. Schwentick. Complexity of decision problems for simple regular expressions. In J. Fiala, V. Koubek, and J. Kratochvil, editors, MFCS, volume 3153 of Lecture Notes in Computer Science, pages 889--900. Springer, 2004.

[17]

M. T. Ozsu and P. Valduriez. Distributed database systems: Where are we now? Computer, 24(8):68--78, 1991.

Digital Library

[18]

Y. Papakonstantinou and V. Vianu. DTD inference for views of XML data. In PODS '00: Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pages 35--46, New York, NY, USA, 2000. ACM.

Digital Library

[19]

W. J. Savitch. Relationships between nondeterministic and deterministic tape complexities. J. Comput. Syst. Sci., 4(2):177--192, 1970.

Digital Library

[20]

H. Seidl. Deciding equivalence of finite tree automata. SIAM J. Comput., 19(3):424--437, 1990.

Digital Library

[21]

L. J. Stockmeyer and A. R. Meyer. Word problems requiring exponential time(preliminary report). In STOC '73: Proceedings of the fifth annual ACM symposium on Theory of computing, pages 1--9, New York, NY, USA, 1973. ACM.

Digital Library

[22]

D. Suciu. Typechecking for semistructured data. In DBPL '01: Revised Papers from the 8th International Workshop on Database Programming Languages, pages 1--20, London, UK, 2002. Springer-Verlag.

Digital Library

[23]

H. Thompson, D. Beech, M. Maloney, and N. Mendelsohn. XML schema part 1: Structures second edition. Internet Publication, Oct 2004. Recommendation, World Wide Web Consortium, Boston, Tokyo, Sophia Antipolis.

[24]

M. Veanes. On computational complexity of basic decision problems of finite tree automata. Technical Report 133, Uppsala Programming Methodology and Artificial Intelligence Laboratory, Sweden, Jan. 1997.

Cited By

Mizumoto HSuzuki N(2014)An XSLT transformation method for distributed XMLFourth edition of the International Conference on the Innovative Computing Technology (INTECH 2014)10.1109/INTECH.2014.6927753(71-80)Online publication date: Aug-2014
https://doi.org/10.1109/INTECH.2014.6927753
Calvanese DDe Giacomo GLenzerini MVardi M(2013)On simplification of schema mappingsJournal of Computer and System Sciences10.1016/j.jcss.2013.01.00579:6(816-834)Online publication date: 1-Sep-2013
https://dl.acm.org/doi/10.1016/j.jcss.2013.01.005
Phan BPardede ERahayu W(2013)On the improvement of active XML (AXML) representation and query evaluationInformation Systems Frontiers10.1007/s10796-012-9363-z15:2(203-222)Online publication date: 1-Apr-2013
https://dl.acm.org/doi/10.1007/s10796-012-9363-z
Show More Cited By

Index Terms

Distributed XML design
1. Computer systems organization
  1. Architectures
    1. Distributed architectures
2. Information systems
  1. Data management systems
    1. Database design and models
      1. Data model extensions
    2. Database management system engines
      1. Parallel and distributed DBMSs

Recommendations

Distributed XML design

A distributed XML document is an XML document that spans several machines. We assume that a distribution design of the document tree is given, consisting of an XML kernel-documentT"["f"""1","...","f"""n"] where some leaves are ''docking points'' for ...
Graph transformation to infer schemata from XML documents
SAC '05: Proceedings of the 2005 ACM symposium on Applied computing

Semi-structured data are characterized by the lack of a predefined schema. This heterogeneity simplifies the management of such data, but analysis and queries become more difficult and demand for schemata that describe these data. Super-imposed ...
Universal fuzzy system representation with XML

An XML schema and an XML DTD (Document Type Definition) are designed as syntax to represent general fuzzy systems in XML. We demonstrate how fuzzy systems described in XML with our proposed schema can be universally compatible with different software by ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PODS '09: Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

June 2009

298 pages

ISBN:9781605585536

DOI:10.1145/1559795

General Chair:
Jan Paredaens
University of Antwerp, Belgium
,
Program Chair:
Jianwen Su
University of California, Santa Barbara, USA

Copyright © 2009 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 29 June 2009

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

SIGMOD/PODS '09

Sponsor:

SIGMOD/PODS '09: International Conference on Management of Data

June 29 - July 1, 2009

Rhode Island, Providence, USA

Acceptance Rates

PODS '09 Paper Acceptance Rate 26 of 97 submissions, 27%;

Overall Acceptance Rate 642 of 2,707 submissions, 24%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
388
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Mizumoto HSuzuki N(2014)An XSLT transformation method for distributed XMLFourth edition of the International Conference on the Innovative Computing Technology (INTECH 2014)10.1109/INTECH.2014.6927753(71-80)Online publication date: Aug-2014
https://doi.org/10.1109/INTECH.2014.6927753
Calvanese DDe Giacomo GLenzerini MVardi M(2013)On simplification of schema mappingsJournal of Computer and System Sciences10.1016/j.jcss.2013.01.00579:6(816-834)Online publication date: 1-Sep-2013
https://dl.acm.org/doi/10.1016/j.jcss.2013.01.005
Phan BPardede ERahayu W(2013)On the improvement of active XML (AXML) representation and query evaluationInformation Systems Frontiers10.1007/s10796-012-9363-z15:2(203-222)Online publication date: 1-Apr-2013
https://dl.acm.org/doi/10.1007/s10796-012-9363-z
Chabin JHalfeld Ferrari MMusicante MRéty P(2013)Conservative Type Extensions for XML DataTransactions on Large-Scale Data- and Knowledge-Centered Systems IX10.1007/978-3-642-40069-8_4(65-94)Online publication date: 2013
https://doi.org/10.1007/978-3-642-40069-8_4
Mizumoto HSuzuki N(2013)A Simple XSLT Processor for Distributed XMLWeb Technologies and Applications10.1007/978-3-642-37401-2_4(7-18)Online publication date: 2013
https://doi.org/10.1007/978-3-642-37401-2_4
Kling PÖzsu MDaudjee K(2011)Scaling XML query processingDistributed and Parallel Databases10.1007/s10619-011-7085-829:5-6(445-490)Online publication date: 1-Oct-2011
https://dl.acm.org/doi/10.1007/s10619-011-7085-8
Chabin JHalfeld-Ferrari MMusicante MRéty P(2010)Minimal Tree Language Extensions: A Keystone of XML Type Compatibility and EvolutionTheoretical Aspects of Computing – ICTAC 201010.1007/978-3-642-14808-8_5(60-75)Online publication date: 2010
https://doi.org/10.1007/978-3-642-14808-8_5

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents