Regular path queries with constraints

被引：48

作者：

Abiteboul, S ^{[1
]}

Vianu, V

机构：

[1] Inst Natl Rech Informat & Automat, F-78153 Le Chesnay, France

[2] Univ Calif San Diego, CSE 0114, La Jolla, CA 92093 USA

来源：

JOURNAL OF COMPUTER AND SYSTEM SCIENCES | 1999年 / 58卷 / 03期

基金：

美国国家航空航天局; 美国国家科学基金会;

关键词：

D O I：

10.1006/jcss.1999.1627

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

The evaluation of path expression queries on semistructured data in a distributed asynchronous environment is considered. The focus is on the use of local information expressed in the form of path constraints in the optimization of path expression queries. In particular, decidability and complexity results on the implication problem for path constraints are established. (C) 1999 Academic Press.

引用

页码：428 / 452

页数：25

共 29 条

[1]

Abiteboul S., 1997, Proceedings of the Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, PODS 1997, P122, DOI 10.1145/263661.263676

[2]

ABITEBOUL S, 1997, P INT C DAT THEOR

[3]

Abiteboul S., 1995, Foundations of databases, V1st

[4]

ABITEBOUL S, 1997, J DIGITAL LIB, V1

[5]

[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness

[6]

Bancilhon F., 1986, P 5 ACM SIGACT SIGMO, P1

[7]

BEERI C, 1987, P ACM S PRINC DAT SY, P214

[8]

Buchsbaum A. L., 1991, Annals of Mathematics and Artificial Intelligence, V3, P187, DOI 10.1007/BF01530925

[9]

Buneman P, 1996, P ACM SIGMOD INT C M, P505

[10]

CONSENS MP, 1990, PROCEEDINGS OF THE NINTH ACM SIGACT-SIGMOD-SIGART SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS, P404, DOI 10.1145/298514.298591

← 1 2 3 →