Extracting schema from semistructured data
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
On the foundations of the universal relation model
ACM Transactions on Database Systems (TODS)
Decomposition—a strategy for query processing
ACM Transactions on Database Systems (TODS)
XTRACT: a system for extracting document type descriptors from XML documents
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Querying websites using compact skeletons
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Flexible queries over semistructured data
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Multiple Query Processing in Deductive Databases using Query Graphs
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Select-Project Queries over XML Documents
NGITS '02 Proceedings of the 5th International Workshop on Next Generation Information Technologies and Systems
SQL4X: A Flexible Query Language for XML and Relational Databases
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Algorithms for acyclic database schemes
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Interconnection semantics for keyword search in XML
Proceedings of the 14th ACM international conference on Information and knowledge management
XSEarch: a semantic search engine for XML
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Efficiently enumerating results of keyword search over data graphs
Information Systems
Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
Journal of Computer and System Sciences
Computing full disjunction using COJO
Information Technology and Management
ExQueX: exploring and querying XML documents
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Optimization of XSLT by compact specialization and combination
WISE'05 Proceedings of the 6th international conference on Web Information Systems Engineering
An abstract framework for generating maximal answers to queries
ICDT'05 Proceedings of the 10th international conference on Database Theory
An unsupervised approach for acquiring ontologies and RDF data from online life science databases
ESWC'10 Proceedings of the 7th international conference on The Semantic Web: research and Applications - Volume Part II
On the effectiveness of flexible querying heuristics for XML data
XSym'07 Proceedings of the 5th international conference on Database and XML Technologies
| Hi-index | 0.00 |
This paper discusses several mechanisms for creating relations out of XML documents. A relation generator consists of two parts: (1) a tuple of path expressions and (2) an index indicating which path expressions may not be assigned the null value. Evaluating a relation generator involves finding tuples of nodes that satisfy the path expressions and are related to one another in a meaningful fashion. Different semantics for evaluation are given that take into account the possible presence of incomplete information. The complexity of generating relations from documents is analyzed and evaluation algorithms are described.