This Article 
 Bibliographic References 
 Add to: 
Object and Combination Shedding Schemes for Adaptive Media Workflow Execution
January 2010 (vol. 22 no. 1)
pp. 105-119
Lina Peng, Brandeis University, Waltham
Renwei Yu, Arizona State University, Tempe
K. Selçuk Candan, Arizona State University, Tempe
Xinxin Wang, Arizona State University, Tempe
Complex media fusion operations can be costly in terms of the time they need to process input objects. If data arrive faster to fusion nodes than the speed with which they can consume the inputs, this will result in some input objects not being processed. In this paper, we develop load shedding mechanisms which take into consideration both data quality and expensive nature of media fusion operators. In particular, we present quality assessment models for objects and multistream fusion operators and highlight that such quality assessments may impose partial orders on objects. We highlight that the most effective load control approach for fusion operators involves shedding of (not the individual input objects but) combinations of objects. Yet, identifying suitable combinations of objects in real time will not be possible if efficient combination selection algorithms do not exist. We develop efficient combination selection schemes for scenarios with different quality assessment and target characteristics. We first develop efficient combination-based load shedding when the fusion operator has unambiguously monotone semantics. We then extend this to the more general ambiguously monotone case and present experimental results that show the performance gains using quality-aware combination-based load shedding strategies under the various fusion scenarios.

[1] M. Akdere, U. Çetintemel, D. Crispell, J. Jannotti, J. Mao, and G. Taubin, “Data-Centric Visual Sensor Networks for 3D Sensing,” Proc. Int'l Conf. Geosensor Networks, 2006.
[2] B. Liu, A. Gupta, and R. Jain, “Medsman: A Streaming Data Management System over Live Multimedia,” Proc. ACM Int'l Conf. Multimedia (MM '05), pp. 171-180, 2005.
[3] K. Nahrstedt and W.T. Balke, “A Taxonomy for Multimedia Service Composition,” Proc. ACM Int'l Conf. Multimedia (MM '04), pp.88-95, 2004.
[4] C. Intanagonwiwat, D. Estrin, R. Govindan, and J.S. Heidemann, “Impact of Network Density on Data Aggregation in Wireless Sensor Networks,” Proc. Int'l Conf. Distributed Computing Systems (ICDCS '02), pp. 457-458, 2002.
[5] Q. Liang, “Power Aware Video Traffic Classification in the Compression Domain,” Proc. IEEE Military Comm. Conf., vol. 2, pp. 1160-1164, 2002.
[6] D.G. Lowe, “Object Recognition from Local Scale Invariant Features,” Proc. Int'l Conf. Computer Vision (ICCV '99), vol. 2, pp.1150-1157, 1999.
[7] K. Mikolajczyk and C. Schmid, “A Performance Evaluation of Local Descriptors,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 27, no. 10, pp. 1615-1630, Oct. 2005.
[8] A. Das, J. Gehrke, and M. Riedewald, “Approximate Join Processing over Data Streams,” Proc. ACM SIGMOD, pp. 40-51, 2003.
[9] N. Tatbul, U. Çetintemel, M. Cherniack, M. Stonebraker, and S. Zdonik, “Load Shedding in a Data Stream Manager,” Proc. Int'l Conf. Very Large Data Bases (VLDB '03), pp. 309-320, 2003.
[10] J. Xie, J. Yang, and Y. Chen, “On Joining and Caching Stochastic Streams,” Proc. ACM SIGMOD, pp. 359-370, 2005.
[11] U. Srivastava and J. Widom, “Memory-Limited Execution of Windowed Stream Joins,” Proc. Int'l Conf. Very Large Data Bases (VLDB '04), pp. 324-335, 2004.
[12] S. Babu, M. Datar, and R. Motwani, “Load Shedding for Aggregation Queries over Data Streams,” Proc. Int'l Conf. Data Eng. (ICDE '04), pp. 350-361, 2004.
[13] N. Tatbul and S. Zdonik, “Window-Aware Load Shedding for Aggregation Queries over Data Streams,” Proc. Int'l Conf. Very Large Data Bases (VLDB), 2006.
[14] Y. Xing, J. Hwang, U. Çetintemel, and S. Zdonik, “Providing Resiliency to Load Variations in Distributed Stream Processing,” Proc. Int'l Conf. Very Large Data Bases (VLDB), 2006.
[15] X. Gu and P. Yu, “Adaptive Load Diffusion for Stream Joins,” Proc. Middleware Conf., 2005.
[16] Z. Abrams and J. Liu, “Greedy Is Good: On Service Tree Placement for In-Network Stream Processing,” Proc. IEEE Int'l Conf. Distributed Computing Systems (ICDCS '06), p. 72, 2006.
[17] L. Amini, N. Jain, A. Sehgal, J. Silber, and O. Verscheure, “Adaptive Control of Extreme-Scale Stream Processing Systems,” Proc. IEEE. Int'l Conf. Distributed Computing Systems (ICDCS '06), p.71, 2006.
[18] A. Deshpande, C. Guestrin, S.R. Madden, J.M. Hellerstein, and W. Hong, “Model-Driven Data Acquisition in Sensor Networks,” Proc. Int'l Conf. Very Large Data Bases (VLDB '04), pp. 588-599, 2004.
[19] R. Cheng, D.V. Kalashnikov, and S. Prabhakar, “Evaluating Probabilistic Queries over Imprecise Data,” Proc. ACM SIGMOD, pp. 551-562, 2003.
[20] R. Fagin, “Fuzzy Queries in Multimedia Database Systems,” Proc. Symp. Principles of Database Systems (PODS), 1998.
[21] R. Fagin, A. Lotem, and M. Naor, “Optimal Aggregation Algorithms for Middleware,” Proc. Symp. Principles of Database Systems (PODS '01), pp. 102-113, 2001.
[22] N. Mamoulis, K.H. Cheng, M.L. Yiu, and D.W. Cheung, “Efficient Aggregation of Ranked Inputs,” Proc. Int'l Conf. Data Eng. (ICDE), 2006.
[23] D. Xin, J. Han, and K.C. Chang, “Progressive and Selective Merge: Computing Top-k with Ad-Hoc Ranking Functions,” Proc. ACM SIGMOD, pp. 775-786, 2007.
[24] D. Papadias, Y. Tao, G. Fu, and B. Seeger, “An Optimal and Progressive Algorithm for Skyline Queries,” Proc. ACM SIGMOD, pp. 467-478, 2003.
[25] M.L. Yiu and N. Mamoulis, “Efficient Processing of Top-k Dominating Queries on Multi-Dimensional Data,” Proc. Int'l Conf. Very Large Data Bases (VLDB '07), pp. 483-494, 2007.
[26] K. Mouratidis, S. Bakiras, and D. Papadias, “Continuous Monitoring of Top-k Queries over Sliding Windows,” Proc. ACM SIGMOD, pp. 635-646, 2006.
[27] X. Lin, Y. Yuan, W. Wang, and H. Lu, “Stabbing the Sky: Efficient Skyline Computation over Sliding Windows,” Proc. IEEE Int'l Conf. Data Eng. (ICDE '05), pp. 502-513, 2005.
[28] I. Bartolini, P. Ciaccia, V. Oria, and M.T. Ozsu, “Integrating the Results of Multimedia Sub-Queries Using Qualitative Preferences,” Proc. Workshop of Multimedia Information Systems, 2004.
[29] C.Y. Chan, P.K. Eng, and K.L. Tan, “Stratified Computation of Skylines with Partially-Ordered Domains,” Proc. ACM SIGMOD, pp. 203-214, 2005.
[30] R. Avnur and J. Hellerstein, “Eddies: Continuously Adaptive Query Processing,” Proc. ACM SIGMOD, pp. 261-272, 2000.
[31] S. Madden, M. Shah, J.M. Hellerstein, and V. Raman, “Continuously Adaptive Continuous Queries over Streams,” Proc. ACM SIGMOD, pp. 49-60, 2002.
[32] M. Hammad, W. Aref, and A. Elmagarmid, “Stream Window Join: Tracking Moving Objects in Sensor-Network Databases,” Proc. Int'l Conf. Scientific and Statistical Database Management (SSDBM '03), pp. 75-84, 2003.
[33] L. Zadeh, “Fuzzy Sets,” Information and Control, vol. 8, pp. 338-353, 1965.
[34] L. Zadeh, “The Concept of a Linguistic Variable and Its Application to Approximate Reasoning-i,” Information Sciences, vol. 8, pp. 199-249, 1975.
[35] S.L. Dockstader and A.M. Tekalp, “Multiple Camera Fusion for Multi-Object Tracking,” Proc. IEEE Workshop Multi-Object Tracking, pp. 95-102, 2001.
[36] L. Peng, R. Yu, K.S. Candan, and X. Wang, “Combination Shedding Schemes for Adaptive Media Workflow Execution,” Technical Report TR-09-003, CSE/SCI, Arizona State Univ., TR-09-003.pdf, 2009.

Index Terms:
Sensor fusion, real-time systems, query processing, multimedia databases.
Lina Peng, Renwei Yu, K. Selçuk Candan, Xinxin Wang, "Object and Combination Shedding Schemes for Adaptive Media Workflow Execution," IEEE Transactions on Knowledge and Data Engineering, vol. 22, no. 1, pp. 105-119, Jan. 2010, doi:10.1109/TKDE.2009.44
Usage of this product signifies your acceptance of the Terms of Use.