Chained forests for fast subsumption matching

ACM International Conference Proceeding Series

Volumn 233, Issue , 2007, Pages 97-102

  Tarkoma, Sasu ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; ELECTRONIC DOCUMENT EXCHANGE; INTERNET; KNOWLEDGE BASED SYSTEMS; PATTERN MATCHING;

CHAINED FORESTS; SUBSCRIBERS; SUBSUMPTION MATCHING;

DATA STRUCTURES;

EID: 34548019750     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1266894.1266912     Document Type: Conference Paper

References (15)

1. P. Briggs and L. Torczon. An efficient representation for sparse sets. ACM Lett. Program. Lang. Syst., 2(1-4):59-69, 1993.
2. P. J. Brown. Triggering information by context. Personal Technologies, 2(1):1-9, September 1998.
3. A. Carzaniga, D. S. Rosenblum, and A. L. Wolf. Design and evaluation of a wide-area event notification service. ACM Transactions on Computer Systems, 19(3):332-383, Aug. 2001.
4. C. Y. Chan, W. Fan, P. Felber, M. N. Garofalakis, and R. Rastogi. Tree pattern aggregation for scalable XML data dissemination. In VLDB, pages 826-837, 2002.
5. C. Collin and R. Levinson. Partial order maintenance. SIGIR Forum, 23(3-4):59-88, 1989.
6. A. Crespo, O. Buyukkokten, and H. Garcia-Molina. Query merging: Improving query subscription processing in a multicast environment. IEEE Trans. Knowl. Data Eng., 15(1):174-191, 2003.
7. A. K. Dey. Understanding and using context. Personal and Ubiquitous Computing, 5(1):4-7, Feb. 2001.
8. C. Doulkeridis and M. Vazirgiannis. Querying and updating a context-aware service directory in mobile environments. In Web Intelligence, pages 562-565. IEEE Computer Society, 2004.
9. P. T. Eugster, P. A. Felber, R. Guerraoui, and A.-M. Kermarrec. The many faces of publish/subscribe. ACM Comput. Surv., 35(2):114-131, 2003.
10. A. Kiani and N. Shiri. Containment of conjunctive queries with arithmetic expressions. In R. Meersman, Z. Tari, M.-S. Hacid, J. Mylopoulos, B. Pernici, Ö. Babaoglu, H.-A. Jacobsen, J. P. Loyall, M. Kifer, and S. Spaccapietra, editors, OTM Conferences (1), volume 3760 of Lecture Notes in Computer Science, pages 439-452. Springer, 2005.
11. L. Li and I. Horrocks. A software framework for matchmaking based on semantic web technology. In WWW '03: Proceedings of the 12th international conference on World Wide Web, pages 331-339, New York, NY, USA, 2003. ACM Press.
12. G. Mühl. Large-Scale Content-Based Publish/Subscribe Systems. PhD thesis, Darmstadt University of Technology, September 2002.
13. I. Podnar, M. Hauswirth, and M. Jazayeri. Mobile push: Delivering content to mobile users. In Proceedings of the 22nd International Conference on Distributed Computing Systems, pages 563-570. IEEE Computer Society, 2002.
14. S. Tarkoma. Efficient Content-based Routing, Mobility-aware Topologies, and Temporal Subspace Matching. PhD thesis, Department of Computer Science, University of Helsinki, 2006. Available at ethesis.helsinki.fi.
15. S. Tarkoma and J. Kangasharju. Optimizing Content-based Routers: Posets and Forests. The Journal of Distributed Computing, 19(1), Sept. 2006.