%0 Conference Paper %1 heuristics2009 %A Murth, Martin %A Kühn, Eva %B 6th Annual European Semantic Web Conference (ESWC2009) %D 2009 %K Collaborative_Software Database_Management_System Performance_Engineering Scalability Semantic_Web continuous_queries heuristics_framework incremental_result_set_updates semantic_subscription_processing similarity_heuristics %P 96-110 %T A Heuristics Framework for Semantic Subscription Processing %U http://data.semanticweb.org/conference/eswc/2009/paper/219 %X The increasing adoption of semantic web technology in application scenarios with frequently changing data has imposed new requirements on the underlying tools. Reasoning algorithms need to be optimized for the processing of dynamic knowledge bases and semantic frameworks have to provide novel mechanisms for detecting changes of knowledge. Today, the latter is mostly realized by implementing simple polling mechanisms. However, this implies client-side post-processing of the received results, causes high response times and limits the overall throughput of the system. In this paper, we present a heuristics framework for realizing a subscription mechanism for dynamic knowledge bases. By analyzing similarities between published information and resulting notifications, heuristics can be employed to “guess” subsequent notifications. As testing the correctness of guessed notifications can be implemented efficiently, notifications can be delivered to the subscribers in an earlier processing phase and the system throughput can be increased. We experimentally evaluate our approach based on a concrete application scenario.

@inproceedings{heuristics2009, abstract = {The increasing adoption of semantic web technology in application scenarios with frequently changing data has imposed new requirements on the underlying tools. Reasoning algorithms need to be optimized for the processing of dynamic knowledge bases and semantic frameworks have to provide novel mechanisms for detecting changes of knowledge. Today, the latter is mostly realized by implementing simple polling mechanisms. However, this implies client-side post-processing of the received results, causes high response times and limits the overall throughput of the system. In this paper, we present a heuristics framework for realizing a subscription mechanism for dynamic knowledge bases. By analyzing similarities between published information and resulting notifications, heuristics can be employed to “guess” subsequent notifications. As testing the correctness of guessed notifications can be implemented efficiently, notifications can be delivered to the subscribers in an earlier processing phase and the system throughput can be increased. We experimentally evaluate our approach based on a concrete application scenario.}, added-at = {2009-05-29T11:44:15.000+0200}, author = {Murth, Martin and Kühn, Eva}, biburl = {https://www.bibsonomy.org/bibtex/2aa174a6cdd1d044db0773e98f049a8e5/eswc2009}, booktitle = {6th Annual European Semantic Web Conference (ESWC2009)}, interhash = {33b1f26557f3f0a25b9763d7dcca542a}, intrahash = {aa174a6cdd1d044db0773e98f049a8e5}, keywords = {Collaborative_Software Database_Management_System Performance_Engineering Scalability Semantic_Web continuous_queries heuristics_framework incremental_result_set_updates semantic_subscription_processing similarity_heuristics}, month = {June}, pages = {96-110}, timestamp = {2009-05-29T11:44:15.000+0200}, title = {A Heuristics Framework for Semantic Subscription Processing}, url = {http://data.semanticweb.org/conference/eswc/2009/paper/219}, year = 2009 }