TY - GEN
T1 - Adding Structure to Unstructured Data
AU - Buneman, Peter
AU - Davidson, Susan
AU - Fernandez, Mary
AU - Suciu, Dan
PY - 1997
Y1 - 1997
N2 - We develop a new schema for unstructured data. Traditional schemas resemble the type systems of programming languages. For unstructured data, however, the underlying type may be much less constrained and hence an alternative way of expressing constraints on the data is needed. Here, we propose that both data and schema be represented as edge-labeled graphs. We develop notions of conformance between a graph database and a graph schema and show that there is a natural and efficiently computable ordering on graph schemas. We then examine certain subclasses of schemas and show that schemas are closed under query applications. Finally, we discuss how they may be used in query decomposition and optimization.
AB - We develop a new schema for unstructured data. Traditional schemas resemble the type systems of programming languages. For unstructured data, however, the underlying type may be much less constrained and hence an alternative way of expressing constraints on the data is needed. Here, we propose that both data and schema be represented as edge-labeled graphs. We develop notions of conformance between a graph database and a graph schema and show that there is a natural and efficiently computable ordering on graph schemas. We then examine certain subclasses of schemas and show that schemas are closed under query applications. Finally, we discuss how they may be used in query decomposition and optimization.
U2 - 10.1007/3-540-62222-5_55
DO - 10.1007/3-540-62222-5_55
M3 - Conference contribution
SN - 978-3-540-62222-2
T3 - Lecture Notes in Computer Science
SP - 336
EP - 350
BT - Database Theory — ICDT '97
PB - Springer-Verlag GmbH
ER -