Results 261 to 270 of about 2,969,729 (299)
Some of the next articles are maybe not open access.
A sequence-based tree similarity search
2015 IEEE 9th International Conference on Research Challenges in Information Science (RCIS), 2015Tree-structured data are pervasively growing and exploiting them based on similarity is essential for a broad number of applications. Therefore, there has been a growing need to develop high-performance techniques to efficiently look for similar trees across a large number of trees.
Alsayed Algergawy
exaly +3 more sources
On the Sequencing of Tree Structures for XML Indexing
21st International Conference on Data Engineering (ICDE'05), 2005Sequence-based XML indexing aims at avoiding expensive join operations in query processing. It transforms structured XML data into sequences so that a structured query can be answered holistically through subsequence matching. In this paper, we address the problem of query equivalence with respect to this transformation, and we introduce a performance ...
Haixun Wang, Xiaofeng Meng 0001
openaire +1 more source
Database management with sequence trees and tokens
IEEE Transactions on Knowledge and Data Engineering, 1997An approach to organizing storage in database systems is presented that, under a wide range of conditions, saves both storage space and processing time. Text values in a database are replaced by short, fixed-length, rank-preserving numeric tokens. The actual values are stored in separate, non-redundant storage.
Robert C. Goldstein +1 more
openaire +1 more source
On certain trees with the same degree sequence
Discrete Applied Mathematics, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On the loopless generation of binary tree sequences
Information Processing Letters, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
An evolutionary tree for invertebrate globin sequences
Journal of Molecular Evolution, 1988A phylogenetic tree was constructed from 245 globin amino acid sequences. Of the six plant globins, five represented the Leguminosae and one the Ulmaceae. Among the invertebrate sequences, 7 represented the phylum Annelida, 13 represented Insecta and Crustacea of the phylum Arthropoda, and 6 represented the phylum Mollusca. Of the vertebrate globins, 4
M, Goodman +8 more
openaire +2 more sources
Radix Tree for Binary Sequences on GPU
2018In this paper, we present radix tree index structure (R-Trie) able to perform lookup over a set of keys of arbitrary length optimized for GPU processors. We present a fully parallel SIMD organized creation and search strategies. The R-Trie supports configurable bit stride for each level and nodes statistics for optimization purposes.
Krzysztof Kaczmarski, Albert Wolant
openaire +1 more source
Enumerative sequences of leaves in rational trees
1997We prove that any IN-rational sequence s=(s n )n≥1 of non-negative integers satisfying the Kraft strict inequality \(\sum\nolimits_{n \geqslant 1} {s_n k^{ - n} } < 1\)is the enumerative sequence of leaves by height of a rational k-ary tree. Particular cases of this result had been previously proven. We give some partial results in the equality case.
Bassino, Frédérique +2 more
openaire +3 more sources
Encoding Trees by Linear Recurrence Sequences
Cybernetics and Systems Analysis, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Tree Memory Networks for Sequence Processing
2019Long-term dependencies are difficult to learn using Recurrent Neural Networks due to the vanishing and exploding gradient problems, since their hidden transform operation is applied linearly in sequence length. We introduce a new layer type (the Tree Memory Unit), whose weight application scales logarithmically in the sequence length.
Frederik Diehl, Alois C. Knoll
openaire +1 more source