We study efficient query processing in distributed web search engines with global index organization. The main performance bottleneck in this case is due to the large amount of i...
A tuple t1 of relation R subsumes tuple t2 of R, with respect to a query Q if for every database, tuple t1 derives all, and possibly more, answers to query Q than derived by tuple ...
Severalmethodshavebeenproposedto compile recursive Datalog programs. The most well-known perform a rewriting of rules using MAGIC or PROBLEM predicates in order to push selections...
Pattern matching mechanisms based on regular expressions feature in a number of recent languages for processing XML. The flexibility of these mechanisms demands novel approaches ...
: The growing use of XML in commercial as well as non-commercial domains to transport information poses new challenges to concepts to access these information. Common ways to acces...
Peter Baumgartner, Ulrich Furbach, Margret Gro&szl...