Incremental database systems: databases from the ground up
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
A query language and optimization techniques for unstructured data
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Object Exchange Across Heterogeneous Information Sources
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Adding Structure to Unstructured Data
ICDT '97 Proceedings of the 6th International Conference on Database Theory
DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
The Rufus System: Information Organization for Semi-Structured Data
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Schemaless Representation of Semistructured Data and Schema Construction
DEXA '97 Proceedings of the 8th International Conference on Database and Expert Systems Applications
A Flexible Kernel Data Model for Bottom-Up Databases and Management of Relationships
IDEAS '98 Proceedings of the 1998 International Symposium on Database Engineering & Applications
Bottom-up scientific databases based on sets and their top-down usage
IDEAS'97 Proceedings of the 1997 international conference on International database engineering and applications symposium
| Hi-index | 0.00 |
The structure of semistructured data is strongly required to be obtained in order to query on a large amount of semistructured data, whereas the structure can not be defined aprior. Data Guides and shape have been proposed to represent the structure of semistructured data. As these can behave as schema in the point of view of representing the structure of data, and are changed according to the existence of objects, these are called dynamic schema in this paper. This paper proposes the semi-dynamic construction method of the dynamic schema. The proposed method uses versions of the dynamic schema. Several versions are kept in the system. Each version of the dynamic schema keeps the objects required to construct its next version from it in a list. The correct dynamic schema can easily be constructed by using the versions of dynamic schema and the lists of objects. The performances in deriving the shape, and inserting and deleting objects are experimentally evaluated. Experimental results show that the proposed method is effective in the case that the retrieval is more frequently occurred than the deletion.