Validity of Tree Pattern Queries with Respect to Schema Information

We prove that various containment and validity problems for tree pattern queries with respect to a schema are EXPTIME-complete. When one does not require the root of a tree pattern query to match the root of a tree, validity of a non-branching tree pattern query with respect to a Relax NG schema or...

Full description

Saved in:
Bibliographic Details
Published inMathematical Foundations of Computer Science 2013 pp. 171 - 182
Main Authors Björklund, Henrik, Martens, Wim, Schwentick, Thomas
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg
SeriesLecture Notes in Computer Science
Subjects
Conjunctive Query
Regular Expression
Tiling System
Tree Automaton
Winning Strategy
Online AccessGet full text

Cover

Abstract We prove that various containment and validity problems for tree pattern queries with respect to a schema are EXPTIME-complete. When one does not require the root of a tree pattern query to match the root of a tree, validity of a non-branching tree pattern query with respect to a Relax NG schema or W3C XML Schema is already EXPTIME-hard when the query does not branch and uses only child axes. These hardness results already hold when the alphabet size is fixed. Validity with respect to a DTD is proved to be EXPTIME-hard already when the query only uses child axes and is allowed to branch only once.
AbstractList We prove that various containment and validity problems for tree pattern queries with respect to a schema are EXPTIME-complete. When one does not require the root of a tree pattern query to match the root of a tree, validity of a non-branching tree pattern query with respect to a Relax NG schema or W3C XML Schema is already EXPTIME-hard when the query does not branch and uses only child axes. These hardness results already hold when the alphabet size is fixed. Validity with respect to a DTD is proved to be EXPTIME-hard already when the query only uses child axes and is allowed to branch only once.
Author Björklund, Henrik
Schwentick, Thomas
Martens, Wim
Author_xml – sequence: 1
  givenname: Henrik
  surname: Björklund
  fullname: Björklund, Henrik
  organization: Umeå University, Sweden
– sequence: 2
  givenname: Wim
  surname: Martens
  fullname: Martens, Wim
  organization: University of Bayreuth, Germany
– sequence: 3
  givenname: Thomas
  surname: Schwentick
  fullname: Schwentick, Thomas
  organization: TU Dortmund University, Germany
BookMark eNo1kNtKAzEYhKNWsK19Ay_yAtH8OTSbSykeCgVP1duQbf7YxXZTNhHx7d1WvRqYGQbmG5FBm1ok5AL4JXBurqypmGRTJZjiEiQTDswRGcneORhwTIYwBWBSKntCJn3_PxN6QIZccsGsUfKMTHJuaq40gLZWD8nszW-a0JRvmiJddoj00ZeCXUufPrFrMNOvpqzpM-Ydrgotib6s1rj1dN7G1G19aVJ7Tk6j32Sc_OmYvN7eLGf3bPFwN59dL1gWUhcWTR0hQLA-RrQi-ChtZU0MGEJdCwWVQo3TuBIxRIhemBACWKxQ-1rEWo6J-N3Nu65p37FzdUof2QF3e0yuv-2k64-7AxW3xyR_APgUWgM
ContentType Book Chapter
Copyright Springer-Verlag Berlin Heidelberg 2013
Copyright_xml – notice: Springer-Verlag Berlin Heidelberg 2013
DOI 10.1007/978-3-642-40313-2_17
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 3642403131
9783642403132
EISSN 1611-3349
Editor Sgall, Jirí
Chatterjee, Krishnendu
Editor_xml – sequence: 1
  givenname: Krishnendu
  surname: Chatterjee
  fullname: Chatterjee, Krishnendu
  email: Krishnendu.Chatterjee@ist.ac.at
– sequence: 2
  givenname: Jirí
  surname: Sgall
  fullname: Sgall, Jirí
  email: sgall@iuuk.mff.cuni.cz
EndPage 182
GroupedDBID -DT
-GH
-~X
1SB
29L
2HA
2HV
5QI
875
AASHB
ABMNI
ACGFS
ADCXD
AEFIE
ALMA_UNASSIGNED_HOLDINGS
EJD
F5P
FEDTE
HVGLF
LAS
LDH
P2P
RIG
RNI
RSU
SVGTG
VI1
~02
ID FETCH-LOGICAL-s235t-f7bf1d1d9affe92daf39897fdeddbb24184e5e6fc2fdf1fa27ddd19e8e5ab2fb3
ISBN 9783642403125
3642403123
ISSN 0302-9743
IngestDate Tue Oct 01 19:53:13 EDT 2024
IsPeerReviewed true
IsScholarly true
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-s235t-f7bf1d1d9affe92daf39897fdeddbb24184e5e6fc2fdf1fa27ddd19e8e5ab2fb3
PageCount 12
ParticipantIDs springer_books_10_1007_978_3_642_40313_2_17
PublicationPlace Berlin, Heidelberg
PublicationPlace_xml – name: Berlin, Heidelberg
PublicationSeriesTitle Lecture Notes in Computer Science
PublicationSubtitle 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings
PublicationTitle Mathematical Foundations of Computer Science 2013
Publisher Springer Berlin Heidelberg
Publisher_xml – name: Springer Berlin Heidelberg
RelatedPersons Kleinberg, Jon M.
Mattern, Friedemann
Nierstrasz, Oscar
Steffen, Bernhard
Kittler, Josef
Vardi, Moshe Y.
Weikum, Gerhard
Sudan, Madhu
Naor, Moni
Mitchell, John C.
Terzopoulos, Demetri
Pandu Rangan, C.
Kanade, Takeo
Hutchison, David
Tygar, Doug
RelatedPersons_xml – sequence: 1
  givenname: David
  surname: Hutchison
  fullname: Hutchison, David
  organization: Lancaster University, Lancaster, UK
– sequence: 2
  givenname: Takeo
  surname: Kanade
  fullname: Kanade, Takeo
  organization: Carnegie Mellon University, Pittsburgh, USA
– sequence: 3
  givenname: Josef
  surname: Kittler
  fullname: Kittler, Josef
  organization: University of Surrey, Guildford, UK
– sequence: 4
  givenname: Jon M.
  surname: Kleinberg
  fullname: Kleinberg, Jon M.
  organization: Cornell University, Ithaca, USA
– sequence: 5
  givenname: Friedemann
  surname: Mattern
  fullname: Mattern, Friedemann
  organization: ETH Zurich, Zurich, Switzerland
– sequence: 6
  givenname: John C.
  surname: Mitchell
  fullname: Mitchell, John C.
  organization: Stanford University, Stanford, USA
– sequence: 7
  givenname: Moni
  surname: Naor
  fullname: Naor, Moni
  organization: Weizmann Institute of Science, Rehovot, Israel
– sequence: 8
  givenname: Oscar
  surname: Nierstrasz
  fullname: Nierstrasz, Oscar
  organization: University of Bern, Bern, Switzerland
– sequence: 9
  givenname: C.
  surname: Pandu Rangan
  fullname: Pandu Rangan, C.
  organization: Indian Institute of Technology, Madras, India
– sequence: 10
  givenname: Bernhard
  surname: Steffen
  fullname: Steffen, Bernhard
  organization: University of Dortmund, Dortmund, Germany
– sequence: 11
  givenname: Madhu
  surname: Sudan
  fullname: Sudan, Madhu
  organization: Massachusetts Institute of Technology, USA
– sequence: 12
  givenname: Demetri
  surname: Terzopoulos
  fullname: Terzopoulos, Demetri
  organization: University of California, Los Angeles, USA
– sequence: 13
  givenname: Doug
  surname: Tygar
  fullname: Tygar, Doug
  organization: University of California, Berkeley, USA
– sequence: 14
  givenname: Moshe Y.
  surname: Vardi
  fullname: Vardi, Moshe Y.
  organization: Rice University, Houston, USA
– sequence: 15
  givenname: Gerhard
  surname: Weikum
  fullname: Weikum, Gerhard
  organization: Max-Planck Institute of Computer Science, Saarbrücken, Germany
SSID ssib045115995
ssj0002792
ssib019775516
ssib024821652
ssj0000988208
Score 1.938152
Snippet We prove that various containment and validity problems for tree pattern queries with respect to a schema are EXPTIME-complete. When one does not require the...
SourceID springer
SourceType Publisher
StartPage 171
SubjectTerms Conjunctive Query
Regular Expression
Tiling System
Tree Automaton
Winning Strategy
Title Validity of Tree Pattern Queries with Respect to Schema Information
URI http://link.springer.com/10.1007/978-3-642-40313-2_17
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1La9wwEBab9NZD0xdtaYsOvS0q1sMPHXpoQkoIIdCySXMzsh40fezCrpdAfn1nLPnRbiikF2OMsa35pNFYmu8bQt45K6wSXrDM-pypghtWySwwXWillHXB207t87w4uVCnV_nVbHYzZZe0zXt7eyev5H9QhWuAK7Jk74Hs8FC4AOeALxwBYTj-Ffz-ucyaKgz1gqtg5bE6Upea0ddqGIYuTMDDAD_8jrvjh8X6x89tXFZGpsL1QNlBZQEfw-uv17_GnZpvN5hZFN3nJK8o9bdLCOhdyu9YrL1H8X9cbJx_3qKWcmLRffEdtRMjXnggfP488aGG_rHp7v5wlvY2zldtlzK206Sdpcn5P5S7OhaJQlFAHgnQPZkLHDX86kTT-OibC1RclFHhNPlbHuu3pKmbxzpGO7PCNBEEXsbwbZKJmpd7ZK_U4AwffDw-PbvsHRGHoDjPx7hZqErwIh_iQNR0Q6G2YTEv0_Cjko0y9ajKGLevYiuQVNS3UkbZp7HVE0LnXZ-4s0XfRT6LA_IQ2TAUaSpg_Mdk5pdPyKMeDJrAeEqOevzpKlDEnyb8acKfIv404U_bFY340wn-z8jFp-PF0QlLBTrYRsi8ZaFsAnfcaROC18KZIHWly-C8c00DsWGlfO6LYEVwgQcjSucc177yuWlEaORzsr9cLf0LQqUspbEuMyooVQXMetYNd8ZlqrAmDy_JvLdCjUNuU_d622CzWtZgs7qzWY02e3Wvu1-T_Xa99W8gumybt6kv_AYsi3F0
link.rule.ids 785,786,790,799,27956
linkProvider Library Specific Holdings
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.title=Mathematical+Foundations+of+Computer+Science+2013&rft.au=Bj%C3%B6rklund%2C+Henrik&rft.au=Martens%2C+Wim&rft.au=Schwentick%2C+Thomas&rft.atitle=Validity+of+Tree+Pattern+Queries+with+Respect+to+Schema+Information&rft.series=Lecture+Notes+in+Computer+Science&rft.pub=Springer+Berlin+Heidelberg&rft.isbn=9783642403125&rft.issn=0302-9743&rft.eissn=1611-3349&rft.spage=171&rft.epage=182&rft_id=info:doi/10.1007%2F978-3-642-40313-2_17
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0302-9743&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0302-9743&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0302-9743&client=summon