1997
DOI: 10.1007/3-540-63438-x_10
|View full text |Cite
|
Sign up to set email alerts
|

Modeling and querying semi-structured data

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

1999
1999
2014
2014

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(2 citation statements)
references
References 17 publications
0
2
0
Order By: Relevance
“…The literature [12] develops a middle formal language to describe semi-structured data for model checking purpose. [13] and [14] employ graph-based formalism to model semi-structured data and query on it based on the fixed point computation. [15] proposes a labeled graph schema to represent semistructured data, and [16] extended that with constraints.…”
Section: Imentioning
confidence: 99%
“…The literature [12] develops a middle formal language to describe semi-structured data for model checking purpose. [13] and [14] employ graph-based formalism to model semi-structured data and query on it based on the fixed point computation. [15] proposes a labeled graph schema to represent semistructured data, and [16] extended that with constraints.…”
Section: Imentioning
confidence: 99%
“…In this paper, we focus on the semantic consistency problem based on this method. The literature [14] develops a middle formal language to describe semistructured data for model-checking purpose and [15] employs graph-based formalism to model semistructured data and queries based on the fixed point computation. We are inspired by the model-checking technology [16], translate the mediate model into a Kripke structure, and encode all semantic query problems into CTL formulae and then we transform the semantic consistency checking problem into a global model-checking procedure.…”
Section: Introductionmentioning
confidence: 99%