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

Valuations in incomplete information databases

โœ Scribed by V.A. Brudno

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
615 KB
Volume
47
Category
Article
ISSN
0020-0255

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Repetitive bibliographical information i
Repetitive bibliographical information in relational databases
โœ Brooks, Terrence A. ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 669 KB

Bibliographical databases frequently have a few long, repetitive strings such as the recurring names of voluminous authors. Potter [Library Trends. 30(l): 21-39; 19811 observed this characteristic of bibliographical databases in his sample from the University of Illinois library catalog. This articl

Querying Incomplete Information in Semis
Querying Incomplete Information in Semistructured Data
โœ Yaron Kanza; Werner Nutt; Yehoshua Sagiv ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 323 KB

graphs, which give rise to three variants of matching. For each variant, we provide algorithms and complexity results. In the filter phase, the maximal matchings resulting from the search phase are subjected to constraints, which may be weak or strong. Strong constraints require all their variables