๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

More Higher-Order Efficiency: Concentration Probability

โœ Scribed by Yutaka Kano

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
347 KB
Volume
67
Category
Article
ISSN
0047-259X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Higher order probabilities
Higher order probabilities
โœ Zoltan Domotor ๐Ÿ“‚ Article ๐Ÿ“… 1981 ๐Ÿ› Springer Netherlands ๐ŸŒ English โš– 652 KB
More Efficient Algorithm for Ordered Tre
More Efficient Algorithm for Ordered Tree Inclusion
โœ Weimin Chen ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 221 KB

Given two ordered trees S S and T T, the tree inclusion problem is to determine whether it is possible to obtain S S from T T by deleting nodes. Recently, this problem has been recognized as an important primitive in query processing for ลฝ< ลฝ .< < <. structured text databases. In this paper we prese