The University of Dublin | Trinity College -- Ollscoil Átha Cliath | Coláiste na Tríonóide
Trinity's Access to Research Archive
Home :: Log In :: Submit :: Alerts ::

TARA >
School of Computer Science and Statistics >
Computer Science >
Computer Science (Scholarly Publications) >

Please use this identifier to cite or link to this item: http://hdl.handle.net/2262/24540

Title: Extending Siena to support more expressive and flexible subscriptions
Other Titles: The 2nd International Conference on Distributed Event-Based Systems
Author: LEWIS, DAVID
O'SULLIVAN, DECLAN
KEENEY, JOHN
JONES, DOMINIC HUGH
Author's Homepage: http://people.tcd.ie/jonesdh
http://people.tcd.ie/delewis
http://people.tcd.ie/osulldps
http://people.tcd.ie/jkeeney
http://people.tcd.ie/jonesdh
Keywords: publish-subscribe
content-based networks
knowledge-based networks
ontologies
semantics
bags
Issue Date: 2008
Citation: John Keeney, Dominik Roblek, Dominic Jones, David Lewis, and D. O'Sullivan, Extending Siena to support more expressive and flexible subscriptions, The 2nd International Conference on Distributed Event-Based Systems, Rome, Italy., 1-4 July 2008., 2008
Abstract: This paper defines and discusses the implementation of two novel extensions to the Siena Content-based Network (CBN) to extend it to become a Knowledge-based Network (KBN) thereby increasing the expressiveness and flexibility of its publications and subscription. One extension provides ontological concepts as an additional message attribute type, onto which subsumption relationships, equivalence, type queries and arbitrary ontological subscription filters can be applied. The second extension provides for a bag type to be used that allows bag equivalence, sub-bag and super-bag relationships to be used in subscription filters, possibly composed with any of the Siena subscription operators or the ontological operators previously mentioned. The performance of this KBN implementation has also been explored. However, to maintain scalability and performance it is important that these extensions do not break Siena’s subscription aggregation algorithm. We also introduce the necessary covering relationships for the new types and operators and examine the subscription matching overhead resulting from these new types and operators.
Description: PUBLISHED
Rome, Italy.
URI: http://hdl.handle.net/2262/24540
Appears in Collections:Computer Science (Scholarly Publications)

Files in This Item:

File Description SizeFormat
DEBS2008_Full.pdfpublished (author copy) peer-reviewed215.13 kBAdobe PDFView/Open


This item is protected by original copyright


Please note: There is a known bug in some browsers that causes an error when a user tries to view large pdf file within the browser window. If you receive the message "The file is damaged and could not be repaired", please try one of the solutions linked below based on the browser you are using.

Items in TARA are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback