{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T10:39:32Z","timestamp":1768473572125,"version":"3.49.0"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T00:00:00Z","timestamp":1565740800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T00:00:00Z","timestamp":1565740800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100004347","name":"AT&T","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100004347","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1343976"],"award-info":[{"award-number":["1343976"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s00778-019-00562-z","type":"journal-article","created":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T17:02:40Z","timestamp":1565802160000},"page":"681-707","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Scalable algorithms for signal reconstruction by leveraging similarity joins"],"prefix":"10.1007","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5251-6186","authenticated-orcid":false,"given":"Abolfazl","family":"Asudeh","sequence":"first","affiliation":[]},{"given":"Jees","family":"Augustine","sequence":"additional","affiliation":[]},{"given":"Azade","family":"Nazi","sequence":"additional","affiliation":[]},{"given":"Saravanan","family":"Thirumuruganathan","sequence":"additional","affiliation":[]},{"given":"Nan","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Gautam","family":"Das","sequence":"additional","affiliation":[]},{"given":"Divesh","family":"Srivastava","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,14]]},"reference":[{"issue":"10","key":"562_CR1","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1145\/1562764.1562787","volume":"52","author":"K Beyer","year":"2009","unstructured":"Beyer, K., Gemulla, R., Haas, P.J., Reinwald, B., Sismanis, Y.: Distinct-value synopses for multiset operations. Commun. ACM 52(10), 87\u201395 (2009)","journal-title":"Commun. ACM"},{"key":"562_CR2","volume-title":"Application of Calculus of Matrices to Method of Least Squares: With Special Reference to Geodetic Calculations","author":"A Bjerhammar","year":"1951","unstructured":"Bjerhammar, A.: Application of Calculus of Matrices to Method of Least Squares: With Special Reference to Geodetic Calculations. Elander, G\u00f6teborg (1951)"},{"issue":"13","key":"562_CR3","first-page":"1425","volume":"9","author":"M Boehm","year":"2016","unstructured":"Boehm, M., Dusenberry, M.W., Eriksson, D., Evfimievski, A.V., Manshadi, F.M., Pansare, N., Reinwald, B., Reiss, F.R., Sen, P., Surve, A.C., et al.: SystemML: declarative machine learning on spark. PVLDB 9(13), 1425\u20131436 (2016)","journal-title":"PVLDB"},{"key":"562_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"key":"562_CR5","unstructured":"Broder, A.Z.: On the resemblance and containment of documents. In: Proceedings on Compression and Complexity of Sequences 1997, pp. 21\u201329 (1997)"},{"issue":"8","key":"562_CR6","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1002\/cpa.20124","volume":"59","author":"EJ Candes","year":"2006","unstructured":"Candes, E.J., Romberg, J.K., Tao, T.: Stable signal recovery from incomplete and inaccurate measurements. Commun. Pure Appl. Math. 59(8), 1207\u20131223 (2006)","journal-title":"Commun. Pure Appl. Math."},{"issue":"452","key":"562_CR7","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1080\/01621459.2000.10474303","volume":"95","author":"J Cao","year":"2000","unstructured":"Cao, J., Davis, D., Vander Wiel, S., Yu, B.: Time-varying network tomography: router link data. J. Am. Stat. Assoc. 95(452), 1063\u20131075 (2000)","journal-title":"J. Am. Stat. Assoc."},{"key":"562_CR8","volume-title":"Survey of Network Traffic Models","author":"B Chandrasekaran","year":"2009","unstructured":"Chandrasekaran, B.: Survey of Network Traffic Models, vol. 567. Washington University, St. Louis CSE (2009)"},{"key":"562_CR9","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Ganti, V., Kaushik, R.: A primitive operator for similarity joins in data cleaning. In: ICDE (2006)","DOI":"10.1109\/ICDE.2006.9"},{"issue":"1","key":"562_CR10","first-page":"213","volume":"1","author":"E Cohen","year":"2008","unstructured":"Cohen, E., Kaplan, H.: Tighter estimation using bottom k sketches. PVLDB 1(1), 213\u2013224 (2008)","journal-title":"PVLDB"},{"key":"562_CR11","doi-asserted-by":"crossref","unstructured":"Cormode, G., Korn, F., Muthukrishnan, S., Srivastava, D.: Finding hierarchical heavy hitters in data streams. In: Proceedings of the 29th International Conference on Very Large Data Bases, vol. 29, pp. 464\u2013475. VLDB Endowment (2003)","DOI":"10.1016\/B978-012722442-8\/50048-3"},{"key":"562_CR12","unstructured":"Craig, I.J., Brown, J.C.: Inverse problems in astronomy: a guide to inversion strategies for remotely sensed data. In: Research Supported by SERC. Adam Hilger, Ltd., Bristol and Boston (1986)"},{"key":"562_CR13","doi-asserted-by":"crossref","unstructured":"Dasu, T., Johnson, T., Muthukrishnan, S., Shkapenyuk, V.: Mining database structure; or, how to build a data quality browser. In: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, pp. 240\u2013251. ACM (2002)","DOI":"10.1145\/564691.564719"},{"issue":"4","key":"562_CR14","first-page":"255","volume":"4","author":"B Ding","year":"2011","unstructured":"Ding, B., K\u00f6nig, A.C.: Fast set intersection in memory. PVLDB 4(4), 255\u2013266 (2011)","journal-title":"PVLDB"},{"key":"562_CR15","unstructured":"Dokmani\u0107, I., Gribonval, R.: Beyond Moore\u2013Penrose part II: the sparse pseudoinverse (2017). arXiv:1706.08701"},{"issue":"1","key":"562_CR16","first-page":"17","volume":"5","author":"P Erdos","year":"1960","unstructured":"Erdos, P., R\u00e9nyi, A.: On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci. 5(1), 17\u201360 (1960)","journal-title":"Publ. Math. Inst. Hung. Acad. Sci."},{"issue":"4","key":"562_CR17","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1109\/JSAC.2002.1003042","volume":"20","author":"B Fortz","year":"2002","unstructured":"Fortz, B., Thorup, M.: Optimizing OSPF\/IS-IS weights in a changing world. IEEE J. Sel. Areas Commun. 20(4), 756\u2013767 (2002)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"2","key":"562_CR18","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s10107-011-0470-2","volume":"129","author":"D Ge","year":"2011","unstructured":"Ge, D., Jiang, X., Ye, Y.: A note on the complexity of $$L_p$$ minimization. Math. Program. 129(2), 285\u2013299 (2011)","journal-title":"Math. Program."},{"key":"562_CR19","unstructured":"Goldschmidt, O.: ISP backbone traffic inference methods to support traffic engineering. In: Internet Statistics and Metrics Analysis (ISMA) Workshop, pp. 1063\u20131075 (2000)"},{"key":"562_CR20","unstructured":"Gong, Y.: Identifying P2P users using traffic analysis (2005). www.symantec.com\/connect\/articles\/identifying-p2p-users-using-traffic-analysis . Accessed 21 May 2007"},{"key":"562_CR21","unstructured":"Gordon, J.: Pareto process as a model of self-similar packet traffic. In: Global Telecommunications Conference, 1995 (GLOBECOM\u201995) vol.\u00a03, pp. 2232\u20132236 (1995)"},{"key":"562_CR22","volume-title":"Three-Dimensional Image Reconstruction in Radiology and Nuclear Medicine","author":"P Grangeat","year":"2013","unstructured":"Grangeat, P., Amans, J.L.: Three-Dimensional Image Reconstruction in Radiology and Nuclear Medicine, vol. 4. Springer, Berlin (2013)"},{"issue":"1","key":"562_CR23","first-page":"201","volume":"1","author":"M Hadjieleftheriou","year":"2008","unstructured":"Hadjieleftheriou, M., Yu, X., Koudas, N., Srivastava, D.: Hashed samples: selectivity estimators for set similarity selection queries. PVLDB 1(1), 201\u2013212 (2008)","journal-title":"PVLDB"},{"key":"562_CR24","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719697","volume-title":"Rank-Deficient and Discrete Ill-Posed Problems: Numerical Aspects of Linear Inversion","author":"PC Hansen","year":"1998","unstructured":"Hansen, P.C.: Rank-Deficient and Discrete Ill-Posed Problems: Numerical Aspects of Linear Inversion. SIAM, Philadelphia (1998)"},{"issue":"11","key":"562_CR25","doi-asserted-by":"publisher","first-page":"1468","DOI":"10.14778\/3236187.3236199","volume":"11","author":"S Hasani","year":"2018","unstructured":"Hasani, S., Thirumuruganathan, S., Asudeh, A., Koudas, N., Das, G.: Efficient construction of approximate ad-hoc ML models through materialization and reuse. Proc. VLDB Endow. 11(11), 1468\u20131481 (2018)","journal-title":"Proc. VLDB Endow."},{"key":"562_CR26","doi-asserted-by":"publisher","first-page":"S195","DOI":"10.1016\/j.brachy.2016.04.357","volume":"15","author":"WT Hrinivich","year":"2016","unstructured":"Hrinivich, W.T., Hoover, D.A., Surry, K., Edirisinghe, C., D\u2019Souza, D., Fenster, A., Wong, E.: Ultrasound guided high-dose-rate prostate brachytherapy: live needle segmentation and 3d image reconstruction using the sagittal transducer. Brachytherapy 15, S195 (2016)","journal-title":"Brachytherapy"},{"key":"562_CR27","doi-asserted-by":"crossref","unstructured":"Kaoudi, Z., Quian\u00e9-Ruiz, J.A., Thirumuruganathan, S., Chawla, S., Agrawal, D.: A cost-based optimizer for gradient descent optimization. In: Proceedings of the 2017 ACM International Conference on Management of Data, pp. 977\u2013992. ACM (2017)","DOI":"10.1145\/3035918.3064042"},{"issue":"3","key":"562_CR28","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1016\/j.jsv.2003.06.031","volume":"275","author":"Y Kim","year":"2004","unstructured":"Kim, Y., Nelson, P.: Optimal regularisation for acoustic source reconstruction by inverse methods. J. Sound Vib. 275(3), 463\u2013487 (2004)","journal-title":"J. Sound Vib."},{"issue":"3","key":"562_CR29","first-page":"155","volume":"1","author":"L Kleinrock","year":"1977","unstructured":"Kleinrock, L., Kamoun, F.: Hierarchical routing for large networks performance evaluation and optimization. Comput. Netw. 1(3), 155\u2013174 (1977)","journal-title":"Comput. Netw."},{"key":"562_CR30","doi-asserted-by":"crossref","unstructured":"Kumar, A., Naughton, J., Patel, J.M., Zhu, X.: To join or not to join? Thinking twice about joins before feature selection. In: Proceedings of the 2016 International Conference on Management of Data, pp. 19\u201334. ACM (2016)","DOI":"10.1145\/2882903.2882952"},{"key":"562_CR31","volume-title":"M\u00e9canique Analytique","author":"JL Lagrange","year":"1853","unstructured":"Lagrange, J.L.: M\u00e9canique Analytique, vol. 1. Mallet-Bachelier, Paris (1853)"},{"key":"562_CR32","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Faloutsos, C.: Sampling from large graphs. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 631\u2013636. ACM (2006)","DOI":"10.1145\/1150402.1150479"},{"key":"562_CR33","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, pp. 177\u2013187. ACM (2005)","DOI":"10.1145\/1081870.1081893"},{"key":"562_CR34","unstructured":"McMahan, B., Ramage, D.: Federated learning: collaborative machine learning without centralized training data. Technical report, Google (2017)"},{"issue":"4","key":"562_CR35","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1145\/964725.633041","volume":"32","author":"A Medina","year":"2002","unstructured":"Medina, A., Taft, N., Salamatian, K., Bhattacharyya, S., Diot, C.: Traffic matrix estimation: existing techniques and new directions. ACM SIGCOMM Comput. Commun. Rev. 32(4), 161\u2013174 (2002)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"562_CR36","first-page":"394","volume":"26","author":"E Moors","year":"1920","unstructured":"Moors, E.: On the reciprocal of the general algebraic matrix (abstract). Bull. Am. Math. Soc. 26, 394\u2013395 (1920)","journal-title":"Bull. Am. Math. Soc."},{"issue":"3","key":"562_CR37","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.acha.2008.07.002","volume":"26","author":"D Needell","year":"2009","unstructured":"Needell, D., Tropp, J.A.: CoSaMP: iterative signal recovery from incomplete and inaccurate samples. Appl. Comput. Harmon. Anal. 26(3), 301\u2013321 (2009)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"3","key":"562_CR38","doi-asserted-by":"publisher","first-page":"1617","DOI":"10.1109\/SURV.2014.012214.00180","volume":"16","author":"BAA Nunes","year":"2014","unstructured":"Nunes, B.A.A., Mendonca, M., Nguyen, X.N., Obraczka, K., Turletti, T.: A survey of software-defined networking: past, present, and future of programmable networks. IEEE Commun. Surv. Tutor. 16(3), 1617\u20131634 (2014)","journal-title":"IEEE Commun. Surv. Tutor."},{"issue":"3","key":"562_CR39","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1017\/S0305004100030401","volume":"51","author":"R. Penrose","year":"1955","unstructured":"Penrose, R.: A generalized inverse for matrices. In: Mathematical proceedings of the Cambridge philosophical society, vol. 51, pp. 406\u2013413. Cambridge University Press, Cambridge (1955)","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"issue":"442","key":"562_CR40","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1080\/01621459.1998.10473707","volume":"93","author":"C Tebaldi","year":"1998","unstructured":"Tebaldi, C., West, M.: Bayesian inference on network traffic using link count data. J. Am. Stat. Assoc. 93(442), 557\u2013573 (1998)","journal-title":"J. Am. Stat. Assoc."},{"key":"562_CR41","doi-asserted-by":"crossref","unstructured":"Trefethen, L.N., Bau\u00a0III, D.: Numerical linear algebra. Society for Industrial and Applied Mathematics, Philadelphia. Technical report, ISBN 978-0-89871-361-9 (1997)","DOI":"10.1137\/1.9780898719574"},{"issue":"1","key":"562_CR42","first-page":"838","volume":"2","author":"D Tsirogiannis","year":"2009","unstructured":"Tsirogiannis, D., Guha, S., Koudas, N.: Improving the performance of list intersection. PVLDB 2(1), 838\u2013849 (2009)","journal-title":"PVLDB"},{"issue":"2","key":"562_CR43","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/2667522.2667536","volume":"42","author":"Paul Tune","year":"2014","unstructured":"Tune, P., Roughan, M.: Maximum entropy traffic matrix synthesis. In: ACM SIGMETRICS Performance Evaluation Review vol.\u00a042(2), pp. 43\u201345 (2014)","journal-title":"ACM SIGMETRICS Performance Evaluation Review"},{"key":"562_CR44","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717570","volume-title":"Computational Methods for Inverse Problems","author":"CR Vogel","year":"2002","unstructured":"Vogel, C.R.: Computational Methods for Inverse Problems. SIAM, Philadelphia (2002)"},{"issue":"1","key":"562_CR45","first-page":"2","volume":"41","author":"C Zhang","year":"2016","unstructured":"Zhang, C., Kumar, A., R\u00e9, C.: Materialization optimizations for feature selection workloads. ACM Trans. Datab. Syst. (TODS) 41(1), 2 (2016)","journal-title":"ACM Trans. Datab. Syst. (TODS)"},{"issue":"1","key":"562_CR46","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1145\/885651.781053","volume":"31","author":"Yin Zhang","year":"2003","unstructured":"Zhang, Y., Roughan, M., Duffield, N., Greenberg, A.: Fast accurate computation of large-scale IP traffic matrices from link loads. In: ACM SIGMETRICS Performance Evaluation Review, vol.\u00a031, pp. 206\u2013217. ACM (2003)","journal-title":"ACM SIGMETRICS Performance Evaluation Review"},{"key":"562_CR47","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Roughan, M., Lund, C., Donoho, D.: An information-theoretic approach to traffic matrix estimation. In: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications, pp. 301\u2013312. ACM (2003)","DOI":"10.1145\/863955.863990"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-019-00562-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-019-00562-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-019-00562-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T03:37:44Z","timestamp":1695094664000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-019-00562-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,14]]},"references-count":47,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["562"],"URL":"https:\/\/doi.org\/10.1007\/s00778-019-00562-z","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,14]]},"assertion":[{"value":"15 December 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 June 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 August 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 August 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}