NDLI: The complexity of XPath query evaluation and XML typing

Content Provider	ACM Digital Library
Author	Gottlob, Georg Koch, Christoph Pichler, Reinhard Segoufin, Luc
Copyright Year	2005
Abstract	We study the complexity of two central XML processing problems. The first is XPath 1.0 query processing, which has been shown to be in PTIME in previous work. We prove that both the data complexity and the query complexity of XPath 1.0 fall into lower (highly parallelizable) complexity classes, while the combined complexity is PTIME-hard. Subsequently, we study the sources of this hardness and identify a large and practically important fragment of XPath 1.0 for which the combined complexity is LOGCFL-complete and, therefore, in the highly parallelizable complexity class $NC^{2}.$ The second problem is the complexity of validating XML documents against various typing schemes like Document Type Definitions (DTDs), XML Schema Definitions (XSDs), and tree automata, both with respect to data and to combined complexity. For data complexity, we prove that validation is in LOGSPACE and depends crucially on how XML data is represented. For the combined complexity, we show that the complexity ranges from LOGSPACE to LOGCFL, depending on the typing scheme.
Starting Page	284
Ending Page	335
Page Count	52
File Format	PDF
ISSN	00045411
e-ISSN	1557735X
DOI	10.1145/1059513.1059520
Journal	Journal of the ACM (JACM)
Volume Number	52
Issue Number	2
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2005-03-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Complexity DTD LOGCFL XML XPath
Content Type	Text
Resource Type	Article
Subject	Hardware and Architecture Information Systems Control and Systems Engineering Artificial Intelligence Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

The complexity of query containment in expressive fragments of XPath 2.0

XPath evaluation in linear time

XPath satisfiability in the presence of DTDs

On the minimization of XPath queries

Containment and equivalence for a fragment of XPath

Query translation from XPath to SQL in the presence of recursive DTDs

XML with incomplete information

XML data exchange: Consistency and query answering

The Complexity of Parallel Evaluation of Linear Recurrences

The complexity of XPath query evaluation and XML typing

Similar Documents

The complexity of query containment in expressive fragments of XPath 2.0

XPath evaluation in linear time

XPath satisfiability in the presence of DTDs

On the minimization of XPath queries

Containment and equivalence for a fragment of XPath

Query translation from XPath to SQL in the presence of recursive DTDs

XML with incomplete information

XML data exchange: Consistency and query answering

The Complexity of Parallel Evaluation of Linear Recurrences

The complexity of XPath query evaluation and XML typing