LOGICS FOR UNRANKED TREES: AN OVERVIEW

被引：25
作者：
Libkin, Leonid [1 ,2 ]
机构：
[1] Univ Edinburgh, Sch Informat, Edinburgh EH8 9YL, Midlothian, Scotland
[2] Univ Toronto, Dept Comp Sci, Toronto, ON M5S 1A1, Canada
来源：
LOGICAL METHODS IN COMPUTER SCIENCE | 2006年 / 2卷 / 03期
基金：
加拿大自然科学与工程研究理事会;
关键词：
XML; unranked trees; query languages; logic; automata; schemas; temporal logics; XPath; navigation; streaming; query evaluation;
D O I：
10.2168/LMCS-2(3:2)2006
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Labeled unranked trees are used as a model of XML documents, and logical languages for them have been studied actively over the past several years. Such logics have different purposes: some are better suited for extracting data, some for expressing navigational properties, and some make it easy to relate complex properties of trees to the existence of tree automata for those properties. Furthermore, logics differ significantly in their model-checking properties, their automata models, and their behavior on ordered and unordered trees. In this paper we present a survey of logics for unranked trees.
引用
收藏
页数：31
相关论文
共 91 条
[1]  
Abiteboul S., 1995, Foundations of databases, V1st
[2]  
Arenas M., 2006, COMBINING TEMP UNPUB
[3]  
Arnold A., 2001, STUDIES LOGIC FDN MA, V146
[4]  
Bar-Yossef Z., ACM S PRINC DAT SYST, P216
[5]  
Barceló P, 2005, IEEE S LOG, P31
[6]   Structural properties of XPath fragments [J].
Benedikt, M ;
Fan, WF ;
Kuper, G .
THEORETICAL COMPUTER SCIENCE, 2005, 336 (01) :3-31
[7]  
Benedikt M, 2005, LECT NOTES COMPUT SC, V3404, P327
[8]   Definable relations and first-order query languages over strings [J].
Benedikt, M ;
Libkin, L ;
Schwentick, T ;
Segoufin, L .
JOURNAL OF THE ACM, 2003, 50 (05) :694-751
[9]  
Benedikt M., 2006, ACM T COMPU IN PRESS
[10]  
Blackburn P., 1994, CONSTRAINTS LANGUAGE, P1
12345678910