Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Adaptive XML Shredding: Architecture, Implementation, and Challenges
Proceedings of the VLDB 2002 Workshop EEXTT and CAiSE 2002 Workshop DTWeb on Efficiency and Effectiveness of XML Tools and Techniques and Data Integration over the Web-Revised Papers
An Adaptable and Adjustable Mapping from XML Data to Tables in RDB
Proceedings of the VLDB 2002 Workshop EEXTT and CAiSE 2002 Workshop DTWeb on Efficiency and Effectiveness of XML Tools and Techniques and Data Integration over the Web-Revised Papers
ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
XML and Object-Relational Database Systems - Enhancing Structural Mappings Based on Statistics
Selected papers from the Third International Workshop WebDB 2000 on The World Wide Web and Databases
Cost-Driven Storage Schema Selection for XML
DASFAA '03 Proceedings of the Eighth International Conference on Database Systems for Advanced Applications
The XML benchmark project
From XML Schema to Relations: A Cost-Based Approach to XML Storage
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Dynamic Ant Colony Optimisation
Applied Intelligence
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
| Hi-index | 0.00 |
One of the ways how to manage XML documents is to exploit tools and functions offered by (object-)relational database systems. The key aim of such techniques is to find the optimal mapping strategy, i.e. the way the XML data are stored into relations. Currently the most efficient approaches, so-called adaptive methods, search a space of possible mappings and choose the one which suits the given sample data and query workload the most. In the paper we exploit a general heuristic method called Ant Colony Optimization (ACO) to solve the XML-to-relational mapping problem. We also adapt the algorithm so it can be used on a dynamic variant of the problem. The algorithms are evaluated in a set of experiments with a conclusion that the ACO-based algorithms are suitable for the problem and can be even used as a basis of a dynamic mapping mechanism.