This HTML5 document contains 44 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n6http://localhost/temp/predkladatel/
n4http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n11http://linked.opendata.cz/resource/domain/vavai/subjekt/
n9http://linked.opendata.cz/ontology/domain/vavai/
shttp://schema.org/
rdfshttp://www.w3.org/2000/01/rdf-schema#
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n15http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n10http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21240%2F12%3A00196583%21RIV13-MSM-21240___/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n20http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n8http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21240%2F12%3A00196583%21RIV13-MSM-21240___
rdf:type
n9:Vysledek skos:Concept
rdfs:seeAlso
http://www.comsis.org/archive.php?show=vol0903
dcterms:description
A new kind of acyclic pushdown automata for an ordered tree is presented. The tree pattern pushdown automaton and the nonlinear tree pattern pushdown automaton represent a complete index of the tree for tree patterns and nonlinear tree patterns, respectively. Given a tree with n nodes, the numbers of distinct tree patterns and nonlinear tree patterns whichmatch the tree can be atmost 2n-1+n and at most (2+v)n-1+2, respectively, where v is the maximal number of nonlinear variables allowed in nonlinear tree patterns. The total sizes of nondeterministic versions of the two pushdown automata are O(n) and O(n2), respectively. We discuss the time complexities and show timings of our implementations using the bit-parallelismtechnique. The timings show that for a given tree the running time is linear to the size of the input pattern. The presented pushdown automata are input-driven and therefore can be also determinised. A new kind of acyclic pushdown automata for an ordered tree is presented. The tree pattern pushdown automaton and the nonlinear tree pattern pushdown automaton represent a complete index of the tree for tree patterns and nonlinear tree patterns, respectively. Given a tree with n nodes, the numbers of distinct tree patterns and nonlinear tree patterns whichmatch the tree can be atmost 2n-1+n and at most (2+v)n-1+2, respectively, where v is the maximal number of nonlinear variables allowed in nonlinear tree patterns. The total sizes of nondeterministic versions of the two pushdown automata are O(n) and O(n2), respectively. We discuss the time complexities and show timings of our implementations using the bit-parallelismtechnique. The timings show that for a given tree the running time is linear to the size of the input pattern. The presented pushdown automata are input-driven and therefore can be also determinised.
dcterms:title
Indexing ordered trees for (nonlinear) tree pattern matching Indexing ordered trees for (nonlinear) tree pattern matching
skos:prefLabel
Indexing ordered trees for (nonlinear) tree pattern matching Indexing ordered trees for (nonlinear) tree pattern matching
skos:notation
RIV/68407700:21240/12:00196583!RIV13-MSM-21240___
n9:predkladatel
n11:orjk%3A21240
n3:aktivita
n20:S
n3:aktivity
S
n3:cisloPeriodika
3
n3:dodaniDat
n8:2013
n3:domaciTvurceVysledku
n4:3764818 n4:9851070 n4:9103945
n3:druhVysledku
n7:J
n3:duvernostUdaju
n18:S
n3:entitaPredkladatele
n10:predkladatel
n3:idSjednocenehoVysledku
141148
n3:idVysledku
RIV/68407700:21240/12:00196583
n3:jazykVysledku
n14:eng
n3:klicovaSlova
Tree patternmatching; nonlinear tree pattern matching; indexing
n3:klicoveSlovo
n12:nonlinear%20tree%20pattern%20matching n12:Tree%20patternmatching n12:indexing
n3:kodStatuVydavatele
RS - Srbská republika
n3:kontrolniKodProRIV
[A6A7B7B69A9A]
n3:nazevZdroje
COMSIS - Computer Science and Information Systems
n3:obor
n19:IN
n3:pocetDomacichTvurcuVysledku
3
n3:pocetTvurcuVysledku
3
n3:rokUplatneniVysledku
n8:2012
n3:svazekPeriodika
9
n3:tvurceVysledku
Janoušek, Jan Melichar, Bořivoj Trávníček, Jan
n3:wos
000309649500007
s:issn
1820-0214
s:numberOfPages
29
n15:doi
10.2298/CSIS111220024T
n6:organizacniJednotka
21240