×

Distributed geometric query monitoring using prediction models. (English) Zbl 1333.68099


MSC:

68P20 Information storage and retrieval of data
68P15 Database theory
68U05 Computer graphics; computational geometry (digital and algorithmic aspects)
68U35 Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.)

Software:

RCV1
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] B. Babcock and C. Olston. 2003. Distributed top-k monitoring. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD’03). 28–39.
[2] S. Burdakis and A. Deligiannakis. 2012. Detecting outliers in sensor networks using the geometric approach. In Proceedings of the 28<sup>th</sup> International Conference on Data Engineering (ICDE’12). 1108–1119.
[3] G. Cormode and M. Garofalakis. 2005. Sketching streams through the net: Distributed approximate query tracking. In Proceedings of the 31<sup>st</sup> International Conference on Very Large Data Bases (VLDB’05). 13–24.
[4] G. Cormode and M. Garofalakis. 2007. Streaming in a connected world: Querying and tracking distributed data streams. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD’07). 1178–1181.
[5] G. Cormode and M. Garofalakis. 2008. Approximate continuous querying over distributed streams. ACM Trans. Database Syst. 33, 2. · Zbl 05457144 · doi:10.1145/1366102.1366106
[6] G. Cormode, M. Garofalakis, S. Muthukrishnan, and R. Rastogi. 2005. Holistic aggregates in a networked world: Distributed tracking of approximate quantiles. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD’05). 25–36.
[7] G. Cormode, S. Muthukrishnan, and K. Yi. 2011. Algorithms for distributed functional monitoring. ACM Trans. Algor. 7, 21:1–21:20. · Zbl 1295.68204
[8] G. Cormode, S. Muthukrishnan, and W. Zhuang. 2007. Conquering the divide: Continuous clustering of distributed data streams. In Proceedings of the 23<sup>rd</sup> International Conference on Data Engineering (ICDE’07). 1036–1045.
[9] A. Das, S. Ganguly, M. Garofalakis, and R. Rastogi. 2004. Distributed set-expression cardinality estimation. In Proceedings of the 13<sup>th</sup> International Conference on Very Large Data Bases (VLDB’04). Vol. 30. 312–323.
[10] A. Deligiannakis, Y. Kotidis, and N. Roussopoulos. 2004. Compressing historical information in sensor networks. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD’04). 527–538.
[11] A. Deligiannakis, Y. Kotidis, and N. Roussopoulos. 2007. Dissemination of compressed historical information in sensor networks. The VLDB J. 16, 4, 439–461. · Zbl 05193019 · doi:10.1007/s00778-005-0173-5
[12] M. Garofalakis, J. Gehrke, and R. Rastogi. 2002. Querying and mining data streams: You only get one look a tutorial. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD’02). 635.
[13] M. Garofalakis, D. Keren, and V. Samoladas. 2013. Sketch-based geometric monitoring of distributed stream queries. Proc. VLDB Endow. 6, 10, 937–948.
[14] N. Giatrakos, A. Deligiannakis, M. Garofalakis, I. Sharfman, and A. Schuster. 2012. Prediction-based geometric monitoring over distributed data streams. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD’12). 265–276. · Zbl 1333.68099
[15] N. Giatrakos, Y. Kotidis, A. Deligiannakis, V. Vassalos, and Y. Theodoridis. 2013. In-network approximate computation of outliers with quality guarantees. Inf. Syst. 38, 8, 1285–1308. · doi:10.1016/j.is.2011.08.005
[16] R. Gupta, K. Ramamritham, and M. Mohania. 2013. Ratio threshold queries over distributed data sources. Proc. VLDB Endow. 6, 8, 565–576.
[17] L. Huang, M. Garofalakis, J. Hellerstein, A. Joseph, and N. Taft. 2006. Toward sophisticated detection with distributed triggers. In Proceedings of the SIGCOMM Workshop on Mining Network Data (MineNet’06). 311–316.
[18] L. Huang, X. Nguyen, M. Garofalakis, and J. M. Hellerstein. 2007. Communication-efficient online detection of network-wide anomalies. In Proceedings of the IEEE International Conference on Computer Communications (INFOCOM’07). 134–142.
[19] A. Jain, J. M. Hellestein, S. Ratnasamy, and D. Wetherall. 2004. A wakeup call for internet monitoring systems: The case for distributed triggers. In Proceedings of the Hot Topics in Networks Workshops (HotNets’04).
[20] R. Keralapura, G. Cormode, and J. Ramamirtham. 2006. Communication-efficient distributed monitoring of thresholded counts. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD’06). 289–300.
[21] D. Keren, I. Sharfman, A. Schuster, and A. Livne. 2012. Shape sensitive geometric monitoring. IEEE Trans. Knowl. Data Engin. 24, 8, 1520–1535. · doi:10.1109/TKDE.2011.102
[22] D. D. Lewis, Y. Yang, T. G. Rose, and F. Li. 2004. RCV1: A new benchmark collection for text categorization research. J. Mach. Learn. Res. 5, 361–397.
[23] Z. Liu, B. Radunovic, and M. Vojnovic. 2012. Continuous distributed counting for non-monotonic streams. In Proceedings of the 31<sup>st</sup> Symposium on Principles of Database Systems (PODS’12). 307–318.
[24] S. R. Madden, M. J. Franklin, J. M. Hellerstein, and W. Hong. 2005. TinyDB: An acquisitional query processing system for sensor networks. ACM Trans. Database Syst. 30, 122–173. · Zbl 05457052 · doi:10.1145/1061318.1061322
[25] C. Olston, J. Jiang, and J. Widom. 2003. Adaptive filters for continuous queries over distributed data streams. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD’03). 563–574.
[26] G. Sagy, D. Keren, I. Sharfman, and A. Schuster. 2010. Distributed threshold querying of general functions by a difference of monotonic representation. Proc. VLDB Endow. 4, 46–57.
[27] G. Sagy, I. Sharfman, D. Keren, and A. Schuster. 2011. Top-k vectorial aggregation queries in a distributed environment. J. Parallel Distrib. Comput. 71, 2, 302–315. · Zbl 1219.68054 · doi:10.1016/j.jpdc.2010.09.002
[28] I. Sharfman, A. Schuster, and D. Keren. 2006. A geometric approach to monitoring threshold functions over distributed data streams. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD’06). 310–312.
[29] I. Sharfman, A. Schuster, and D. Keren. 2007a. Aggregate threshold queries in sensor networks. In Proceedings of the IEEE International Parallel and Distributed Processing Symposium (IPDPS’07). 1–10.
[30] I. Sharfman, A. Schuster, and D. Keren. 2007b. A geometric approach to monitoring threshold functions over distributed data streams. ACM Trans. Database Syst. 32, 4. · Zbl 05457136 · doi:10.1145/1292609.1292613
[31] I. Sharfman, A. Schuster, and D. Keren. 2008. Shape sensitive geometric monitoring. In Proceedings of the 27<sup>th</sup> ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS’08). 301–310. · doi:10.1145/1376916.1376958
[32] K. Yi and Q. Zhang. 2013. Optimal tracking of distributed heavy hitters and quantiles. Algorithmica 65, 1, 206–223. · Zbl 1259.68042 · doi:10.1007/s00453-011-9584-4
[33] Q. Zhang, J. Liu, and W. Wang. 2008. Approximate clustering on distributed data streams. In Proceedings of the 24<sup>th</sup> International Conference on Data Engineering (ICDE’08). 1131–1139.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.