Magic sets and other strange ways to implement logic programs (extended abstract)
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Sets and negation in a logic data base language (LDL1)
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Active Databases as a Paradigm for Enhanced Computing Environments
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Active rules for XML: A new paradigm for E-services
The VLDB Journal — The International Journal on Very Large Data Bases
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Estimating the size of the transitive closure in linear time
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
OTM'05 Proceedings of the 2005 OTM Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, COA, and ODBASE - Volume Part II
Expressing and managing reactivity in the semantic web
OTM'10 Proceedings of the 2010 international conference on On the move to meaningful internet systems: Part II
Expressing and managing reactivity in the semantic web
OTM'10 Proceedings of the 2010 international conference on On the move to meaningful internet systems: Part II
Hi-index | 0.00 |
In this paper, we describe an approach aiming at enriching the Semantic Web with active information. We propose ACTION, an ACTIve ONtology formalism to express reactive behavior. In ACTION, events are categorized as concepts of an ontology and, in conjunction with classes, properties and instances, are considered during the query answering and reasoning tasks. We hypothesize that ACTION provides a more expressive solution to the problem of representing and querying active knowledge than existing ECA-based approaches. However, this expressivity power can negatively impact on the complexity of the query processing and reasoning tasks because the number of derived data depends on the number and relationships of the events. The main source of complexity is produced because the number of the derived facts is polynomial with respect to the size of the events, and the same evaluations may be fired by different events. To overcome this problem, we propose optimization strategies to identify Magic Set rewritings where the number of duplicate evaluations is minimized. We present the query rewriting technique called Intersection of Magic Rewritings (IMR), which is based on Magic Sets rewritings that annotate the minimal set of rules that need to be evaluated to process reactive behavior on an ontology. We have conducted an experimental study and have observed that the proposed strategies are able to speed up the tasks of reasoning and query evaluation in two orders of magnitude for small ontologies, and in four orders of magnitude for medium and large ontologies, with respect to the bottom-up strategy.