Least common container of tree pattern queries and its applications (Q715041): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00236-012-0155-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987990367 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree pattern query minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural properties of XPath fragments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Containment and equivalence for a fragment of XPath / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of XPath containment in the presence of disjunction, DTDs, and variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of query containment in expressive fragments of XPath 2.0 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414543 / rank
 
Normal rank

Latest revision as of 18:05, 5 July 2024

scientific article
Language Label Description Also known as
English
Least common container of tree pattern queries and its applications
scientific article

    Statements

    Least common container of tree pattern queries and its applications (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 October 2012
    0 references
    maximal contained rewriting of a tree pattern
    0 references

    Identifiers