On the approximability of some maximum spanning tree problems
Theoretical Computer Science - Special issue: Latin American theoretical informatics
On the approximation of finding a(nother) hamiltonian cycle in cubic hamiltonian graphs
Journal of Algorithms
ERX: a conceptual model for XML documents
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 2
NeT & CoT: translating relational schemas to XML schemas using semantic constraints
Proceedings of the eleventh international conference on Information and knowledge management
The Directed Minimum-Degree Spanning Tree Problem
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Efficiently publishing relational data as XML documents
The VLDB Journal — The International Journal on Very Large Data Bases
Designing Semistructured Databases Using ORA-SS Model
WISE '01 Proceedings of the Second International Conference on Web Information Systems Engineering (WISE'01) Volume 1 - Volume 1
An efficient algorithm for computing bisimulation equivalence
Theoretical Computer Science
Integrating XML and Relational Database Systems
World Wide Web
Mapping Relational Schemas to XML DTDs with Constraints
IMSCCS '06 Proceedings of the First International Multi-Symposiums on Computer and Computational Sciences - Volume 2 (IMSCCS'06) - Volume 02
Conceptual modeling of XML data
Proceedings of the 2006 ACM symposium on Applied computing
XSEM: a conceptual model for XML
APCCM '07 Proceedings of the fourth Asia-Pacific conference on Comceptual modelling - Volume 67
XMark: a benchmark for XML data management
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
The XML Tree Model - toward an XML conceptual schema reversed from XML Schema Definition
Data & Knowledge Engineering
Proceedings of the 2008 ACM symposium on Applied computing
Know your limits: enhanced XML modeling with cardinality constraints
ER '07 Tutorials, posters, panels and industrial contributions at the 26th international conference on Conceptual modeling - Volume 83
Designing XML documents from conceptual schemas and workload information
Multimedia Tools and Applications
Information and Software Technology
Object role modelling and XML-Schema
ER'00 Proceedings of the 19th international conference on Conceptual modeling
XML conceptual modeling using UML
ER'00 Proceedings of the 19th international conference on Conceptual modeling
Holistic constraint-preserving transformation from relational schema into XML schema
DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
Fundamentals of Database Systems
Fundamentals of Database Systems
Designing quality XML schemas from e-r diagrams
WAIM '06 Proceedings of the 7th international conference on Advances in Web-Age Information Management
Hi-index | 0.00 |
We propose a mapping from a database conceptual design to a schema for XML that produces highly connected and nested XML structures. We first introduce two alternative definitions of the mapping, one modeling entities as global XML elements and expressing relationships among them in terms of keys and key references (flat design), the other one encoding relationships by properly including the elements for some entities into the elements for other entities (nest design). Then we provide a benchmark evaluation of the two solutions showing that the nest approach, compared to the flat one, leads to improvements in both query and validation performances. This motivates us to systematically investigate the best way to nest XML structures. We identify two different nesting solutions: a maximum depth nesting, that keeps low the number of costly join operations that are necessary to reconstruct information at query time using the mapped schema, and a maximum density nesting, that minimizes the number of schema constraints used in the mapping of the conceptual schema, thus reducing the validation overhead. On the one hand, the problem of finding a maximum depth nesting turns out to be NP-complete and, moreover, it admits no constant ratio approximation algorithm. On the other hand, we devise a graph-theoretic algorithm, NiduX, that solves the maximum density problem in linear time. Interestingly, NiduX finds the optimal solution for the harder maximum depth problem whenever the conceptual design graph is either acyclic or complete. In randomly generated intermediate cases of the graph topology, we experimentally show that NiduX finds a good approximation of the optimal solution.