Sciweavers

155 search results - page 18 / 31
» Non-Determinism in Deductive Databases
Sort
View
HIM
1997
Springer
162views Multimedia» more  HIM 1997»
14 years 2 months ago
Probabilistic Logical Information Retrieval for Content, Hypertext, and Database Querying
Classical retrieval models support content-oriented searching for documents using a set of words as data model. However, in hypertext and database applications we want to consider...
Thomas Rölleke, Markus Blömer
MFDBS
1989
102views Database» more  MFDBS 1989»
14 years 1 months ago
Transitive Closure and the LOGA+-Strategy for its Efficient Evaluation
One of the key problems when extending relational database query languages to include deductive capabilities, is to provide them with efficient methods for answering recursive que...
W. Yan, Nelson Mendonça Mattos
FLAIRS
2008
14 years 4 days ago
Declarative Specification and Interpretation of Rule-Based Systems
A declarative rule inference engine can be very useful for modern distributed or heterogeneous applications, if it can be configured for multiple semantics and evaluation strategi...
Dietmar Seipel, Joachim Baumeister
CL
2000
Springer
14 years 2 months ago
Design and Implementation of the Physical Layer in WebBases: The XRover Experience
Webbases are database systems that enable creation of Web applications that allow end users to shop around for products and services at various Web sites without having to manually...
Hasan Davulcu, Guizhen Yang, Michael Kifer, I. V. ...
ENC
2004
IEEE
14 years 1 months ago
Efficient Data Structures and Parallel Algorithms for Association Rules Discovery
Discovering patterns or frequent episodes in transactions is an important problem in data-mining for the purpose of infering deductive rules from them. Because of the huge size of...
Christophe Cérin, Gay Gay, Gaël Le Mah...