Operator placement for snapshot multi-predicate queries in wireless sensor networks

Proceedings - IEEE International Conference on Mobile Data Management

Volumn , Issue , 2009, Pages 21-30

  Chatzimilioudis, Georgios ^a   Hakkoymaz, Huseyin ^a   Mamoulis, Nikos ^b   Gunopulos, Dimitrios ^a  

^a University of California Riverside   (United States)

^b UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

BATTERY LIFE; COMMUNICATION COST; COMPUTATIONAL POWER; DISTRIBUTED DATABASE; DYNAMIC PROGRAMMING ALGORITHM; EXPERIMENTAL EVALUATION; LOW COMPLEXITY; MINIMAL PATH; NETWORK SIZE; NP-HARD; OPTIMAL SOLUTIONS; POINT PROBLEM; PREDICATE QUERY; PROBLEM INSTANCES; TRANSMITTING DATA; WEIGHTED GRAPH;

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL EFFICIENCY; COSTS; HEURISTIC ALGORITHMS; HEURISTIC METHODS; MATHEMATICAL OPERATORS; MIDDLEWARE; PORTALS; PROBLEM SOLVING; SENSOR NETWORKS; SYSTEMS ENGINEERING; WIRELESS TELECOMMUNICATION SYSTEMS;

WIRELESS SENSOR NETWORKS;

EID: 70349496587     PISSN: 15516245     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MDM.2009.13     Document Type: Conference Paper

References (35)

1. A. Banerjee, A. Mitra, W. Najjar, D. Zeinalipour-Yazti, V. Kalogeraki, and D. Gunopulos, "Rise - co-s : high performance sensor storage and co-processing architecture", Sensor and Ad Hoc Communications and Networks, 2005. IEEE SECON 2005. 2005 Second Annual IEEE Communications Society Conference on, pp. 1-12, Sept., 2005.
2. D. Zeinalipour-Yazti, V. Kalogeraki, D. Gunopulos, and W. A. Najjar, "Data acquisition in sensor networks with large memories", in ICDE Workshops, 2005, p. 1188.
3. M. Hadjieleftheriou, G. Kollios, P. Bakalov, and V. J. Tsotras, "Complex spatio-temporal pattern queries", in Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, August 30 - September 2, 2005. ACM, 2005, pp. 877-888.
4. S. Madden, M. J. Franklin, J. M. Hellerstein, and W. Hong, "Tinydb: an acquisitional query processing system for sensor networks", ACM Trans. Database Syst., vol. 30, no. 1, pp. 122-173, 2005.
5. E. D. Demaine, A. López-Ortiz, and J. I. Munro, "Adaptive set intersections, unions, and differences", in SODA '00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics, 2000, pp. 743-752.
6. J. Barbay and C. Kenyon, "Adaptive intersection and t-threshold problems", in SODA '02: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics, 2002, pp. 390-399.
7. R. A. Baeza-Yates, "A fast set intersection algorithm for sorted sequences", in Combinatorial Pattern Matching, 15th Annual Symposium, CPM 2004, Istanbul,Turkey, July 5-7, 2004, Proceedings, ser. Lecture Notes in Computer Science, vol. 3109. Springer, 2004, pp. 400-408.
8. J. Barbay, A. Lpez-Ortiz, and T. Lu, "Faster adaptive set intersections for text searching", pp. 146-157, 2006. [Online]. Available: http://www.springerlink.com/content/7w44241l1m318000
9. H. Lu and M. J. Carey, "Some experimental results on distributed join algorithms in a local network", in 11th International Conference on Very Large Data Bases. Stockholm, Sweden: Morgan Kaufmann, 21-23 Aug. 1985, pp. 292-304.
10. * optimizer validation and performance evaluation for distributed queries", in Twelfth International Conference on Very Large Data Bases. Kyoto, Japan: Morgan Kaufmann, 25-28 Aug. 1986, pp. 149-159.
11. J.-M. Chang, "A heuristic approach to distributed query processing", in VLDB '82: Proceedings of the 8th International Conference on Very Large Data Bases. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc., 1982, pp. 54-61.
12. M.-S. Chen and P. S. Yu, "A graph theoretical approach to determine a join reducer sequence in distributed query processing", IEEE Transactions in Knowledge Data Engineering, vol. 6, no. 1, pp. 152-165, 1994.
13. J. M. Hellerstein, "Optimization techniques for queries with expensive methods", ACM Trans. Database Syst., vol. 23, no. 2, pp. 113-157, 1998.
14. Monma, Clyde L. and Sidney, Jeffrey B., "Sequencing with seriesparallel precedence constraints", Mathematics of Operations Research, vol. 4, no. 3, pp. 215-224, aug 1979.
15. A. Meliou, D. Chu, J. M. Hellerstein, C. Guestrin, and W. Hong, "Data gathering tours in sensor networks", in Proceedings of the Fifth International Conference on Information Processing in Sensor Networks, IPSN 2006, Nashville, Tennessee, USA, April 19-21, 2006. ACM, 2006, pp. 43-50.
16. A. Coman, M. A. Nascimento, and J. Sander, "On join location in sensor networks", in MDM, 2007, pp. 190-197.
17. H. Yu, E.-P. Lim, and J. Zhang, "On in-network synopsis join processing for sensor networks", in MDM '06: Proceedings of the 7th International Conference on Mobile Data Management. Washington, DC, USA: IEEE Computer Society, 2006, p. 32.
18. T.-W. Chen and M. Gerla, "Global state routing: a new routing scheme for ad-hoc wireless networks", Communications, 1998. IC 98. Conference Record, vol. 1, pp. 171-175, 7-11 Jun 1998.
19. B. Karp, "Gpsr: Greedy perimeter stateless routing for wireless networks", pp. 243-254, 2000.
20. S. Lin, B. Arai, and D. Gunopulos, "Reliable hierarchical data storage in sensor networks", Scientific and Statistical Database Management, 2007. SSBDM '07. 19th International Conference on, pp. 26-26, July 2007.
21. D. Zeinalipour-yazti, S. Lin, V. Kalogeraki, D. Gunopulos, and W. A. Najjar, "Microhash: An efficient index structure for flash-based sensor devices", in In FAST, 2005, pp. 31-44.
22. C. Estan and J. Naughton, "End-biased samples for join cardinality estimation", Data Engineering, 2006. ICDE '06. Proceedings of the 22nd International Conference on, pp. 20-20, April 2006.
23. R. J. Lipton, J. F. Naughton, and D. A. Schneider, "Practical selectivity estimation through adaptive sampling", 1990, pp. 1-11.
24. Y. Tao, G. Kollios, J. Considine, F. Li, and D. Papadias, "Spatio-temporal aggregation using sketches", in ICDE. IEEE Computer Society, 2004, pp. 214-226.
25. B. H. Bloom, "Space/time tradeoffs in hash coding with allowable errors", Comm. of the ACM, vol. 13, no. 7, p. 422, July 1970.
26. R. M. Karp, "Reducibility among combinatorial problems", in Complexity of Computer Computations. NY: Plenum Press, 1972, pp. 85-103.
27. S. Guha, R. Rastogi, and K. Shim, "Cure: an efficient clustering algorithm for large databases", Proceedings of the 1998 ACM SIGMODinternational conference on Management of data, pp. 73-84, 1998.
28. Y.-M. Song, S.-H. Lee, and Y.-B. Ko, "Ferma: An efficient geocasting protocol for wireless sensor networks with multiple target regions", in EUC Workshops, 2005, pp. 1138-1147.
29. J. Son, J. Pak, H. Kim, and K. Han, "A decentralized hierarchical aggregation scheme using fermat points in wireless sensor networks", in EvoWorkshops, 2007, pp. 153-160.
30. R. Courant and H. Robbins, What Is Mathematics? Oxford University Press, 1941.
31. C. Intanagonwiwat, R. Govindan, and D. Estrin, "Directed diffusion: a scalable and robust communication paradigm for sensor networks", in MOBICOM, 2000, pp. 56-67.
32. B. Krishnamachari, D. Estrin, and S. B. Wicker, "The impact of data aggregation in wireless sensor networks", in ICDCS Workshops. IEEE Computer Society, 2002, pp. 575-578.
33. S. Madden, M. J. Franklin, J. Hellerstein, and W. Hong, "Tag: a tiny aggregation service for ad-hoc sensor networks", in In OSDI, 2002.
34. T. Brinkhoff, "A framework for generating network-based moving objects", 2002.
35. W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, "Energy-efficient communication protocol for wireless microsensor networks", in Hawaii International Conference on System Sciences, 2000. [Online]. Available: http://computer.org/proceedings/hicss/0493/04938/ 04938020abs.htm