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

DOI10.1016/j.jpdc.2012.09.002zbMath1270.68047OpenAlexW1972957404WikidataQ60148579 ScholiaQ60148579MaRDI QIDQ362593

Srikanta Tirthapura, Zhenhui Shen

Publication date: 22 August 2013

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://lib.dr.iastate.edu/ece_pubs/179

zbMATH Keywords

publish-subscribespace filling curvesubsription covering

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed systems (68M14)

Cites Work

• Unnamed Item
• Unnamed Item
• New trie data structures which support very fast search operations
• On the equivalence of some rectangle problems
• Lower bounds for orthogonal range searching: I. The reporting case
• Lower bounds for orthogonal range searching: part II. The arithmetic model
• Adding range restriction capability to dynamic data structures
• Gray codes for partial match and range queries

This page was built for publication: Approximate covering detection among content-based subscriptions using space filling curves