𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient algorithms for answering queries with unsorted multilists

✍ Scribed by Billy G. Claybrook; Chung-Shu Yang

Book ID
103696194
Publisher
Elsevier Science
Year
1978
Tongue
English
Weight
483 KB
Volume
3
Category
Article
ISSN
0959-2954

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Efficient algorithms for processing XPat
Efficient algorithms for processing XPath queries
✍ Gottlob, Georg; Koch, Christoph; Pichler, Reinhard πŸ“‚ Article πŸ“… 2005 πŸ› Association for Computing Machinery 🌐 English βš– 705 KB
Efficient algorithms for processing XPat
Efficient algorithms for processing XPath queries
✍ Gottlob, Georg; Koch, Christoph; Pichler, Reinhard πŸ“‚ Article πŸ“… 2005 πŸ› Association for Computing Machinery 🌐 English βš– 705 KB

Our experimental analysis of several popular XPath processors reveals a striking fact: Query evaluation in each of the systems requires time exponential in the size of queries in the worst case. We show that XPath can be processed much more efficiently, and propose main-memory algorithms for this pr

Query Answering for OWL-DL with rules
Query Answering for OWL-DL with rules
✍ Boris Motik; Ulrike Sattler; Rudi Studer πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 283 KB

Both OWL-DL and function-free Horn rules are decidable fragments of first-order logic with interesting, yet orthogonal expressive power. A combination of OWL-DL and rules is desirable for the Semantic Web; however, it might easily lead to the undecidability of interesting reasoning problems. Here, w