Approximate covering detection among content-based subscriptions using space filling curves

Journal of Parallel and Distributed Computing

Volumn 72, Issue 12, 2012, Pages 1591-1602

  Shen, Zhenhui ^a   Tirthapura, Srikanta ^b  

^a AKAMAI TECHNOLOGIES   (United States)

^b Iowa State University   (United States)

Author keywords

Publish subscribe; Space filling curve; Subscription covering

Indexed keywords

APPROXIMATION ERRORS; COMPUTATIONAL TASK; CONTENT-BASED; CONTENT-BASED SUBSCRIPTION; EXHAUSTIVE SEARCH; MULTI-ATTRIBUTES; PUBLISH-SUBSCRIBE; PUBLISH-SUBSCRIBE SYSTEMS; ROUTING TABLE; SPACE-FILLING CURVE; SUBSCRIPTION COVERING; TIME COMPLEXITY;

OPTIMIZATION;

FILLING;

EID: 84867814028     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2012.09.002     Document Type: Conference Paper

References (28)

1. A. Carzaniga, M.J. Rutherford, A.L. Wolf, A routing scheme for content-based networking, in: Proc. IEEE INFOCOM 2004, 2004.
2. Raphaël Chand, Pascal Felber, Xnet: a reliable content-based publish/subscribe system, in: Proc. International Symposium on Reliable Distributed Systems, SRDS, 2004, pp. 264-273.
3. B. Chazelle Lower bounds for orthogonal range searching: I. The reporting case Journal of the ACM 37 1990 200 212
4. B. Chazelle Lower bounds for orthogonal range searching: II. The arithmetic model Journal of the ACM 37 1990 439 463
5. G. Cugola, E. Di Nitto, and A. Fuggetta The JEDI event-based infrastructure and its application to the development of the OPSS WFMS IEEE Transactions on Software Engineering 27 9 2001 827 850
6. H. Edelsbrunner, and M.H. Overmars On the equivalence of some rectangle problems Information Processing Letters 14 3 1982 124 127
7. C. Faloutsos, Multiattribute hashing using gray codes, in: Proc. ACM SIGMOD Conference on Management of Data, 1986, pp. 227-238.
8. C. Faloutsos Gray codes for partial match and range queries IEEE Transactions on Software Engineering 14 10 1988 1381 1393
9. V. Gaede, and O. Günther Multidimensional access methods ACM Computing Surveys 30 1998 170 231
10. D. Hilbert Uber die stetige Abbildung einer Linie auf ein Flachenstuck Mathematische Annalen 38 1891 459 460
11. Hojjat Jafarpour, Sharad Mehrotra, Nalini Venkatasubramanian, Mirko Montanari, Mics: an efficient content space representation model for publish/subscribe systems, in: Proc. Third ACM International Conference on Distributed Event-Based Systems, DEBS, 2009, pp. 7:1-7:12.
12. V.J. Leung, E.M. Arkin, M.A. Bender, D.P. Bunde, J. Johnston, A. Lal, J.S.B. Mitchell, C.A. Phillips, S.S. Seiden, Processor allocation on cplant: achieving general processor locality using one-dimensional allocation strategies, in: Proc. IEEE International Conference on Cluster Computing, CLUSTER, 2002, pp. 296-304.
13. G. Li, S. Hou, H. Jacobsen, A unified approach to routing, covering and merging in publish/subscribe systems based on modified binary decision diagrams, in: Proc. International Conference on Distributed Computing Systems, ICDCS, 2005, pp. 447-457.
14. B. Moon, H.V. Jagadish, C. Faloutsos, and J.H. Saltz Analysis of the clustering properties of the Hilbert space-filling curve The IEEE Transactions on Knowledge and Data Engineering 13 1 2001 124 141
15. G.M. Morton A Computer Oriented Geodetic Data Base and A New Technique in File Sequencing 1966 IBM Ottawa, Canada
16. G. Mühl, L. Fiege, A.P. Buchmann, Filter similarities in content-based publish/subscribe systems, in: Proc. International Conference on Architecture of Computing Systems, ARCS, 2002, pp. 224-238.
17. A. Nakano, R.K. Kalia, and P. Vashishta Scalable molecular dynamics visualization, and data management algorithms for materials simulations IEEE Computing in Science and Engineering 1 5 1999 39 47
18. Oracle spatial. 2001. http://www.orafaq.com/faq/spatial.
19. A. Ouksel, O. Jurca, I. Podnar, K. Aberer, Efficient probabilistic subsumption checking for content-based publish/subscribe systems, in: Proc. ACM/IFIP/USENIX International Conference on Middleware, Middleware, 2006, pp. 121-140.
20. F.P. Preparata, and M.I. Shamos Computational Geometry: An Introduction 1985 Springer-Verlag
21. Z. Shen, S. Aluru, S. Tirthapura, Indexing for subscription covering in publish-subscribe systems, in: Proceedings of the 18th International Conference on Parallel and Distributed Computing Systems, PDCS, 2005, pp. 328-333.
22. S. Tirthapura, S. Seal, S. Aluru, A formal analysis of space filling curves for parallel domain decomposition, in: Proc. IEEE International Conference on Parallel Processing, 2006, pp. 505-512.
23. Duc A. Tran, Thinh Nguyen, A random projection approach to subscription covering detection in publish/subscribe systems, in: CollaborateCom, 2007, pp. 362-369.
24. P. Triantafillou, A. Economides, Subscription summarization: a new paradigm for efficient publish/subscribe systems, in: Proc. International Conference on Distributed Computing Systems, ICDCS, 2004, pp. 562-571.
25. M. Warren, J. Salmon, A parallel hashed-octtree N-body algorithm, in: Proc. Supercomputing, 1993, pp. 12-21.
26. D.E. Willard New trie data structures which support very fast search operations Journal of Computer and System Sciences 28 3 1984 379 394
27. D.E. Willard, and G.S. Lueker Adding range restriction capability to dynamic data structures Journal of the ACM 32 3 1985 597 617
28. Y. Zhao, D. Sturman, S. Bhola, Subscription propagation in highly-available publish/subscribe middleware, in: Proc. ACM/IFIP/USENIX International Conference on Middleware, Middleware, 2004, pp. 274-293.