{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T17:59:32Z","timestamp":1772906372440,"version":"3.50.1"},"reference-count":23,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3735,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1016\/s0022-0000(03)00026-6","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T01:09:12Z","timestamp":1052788152000},"page":"614-656","source":"Crossref","is-referenced-by-count":590,"title":["Optimal aggregation algorithms for middleware"],"prefix":"10.1016","volume":"66","author":[{"given":"Ronald","family":"Fagin","sequence":"first","affiliation":[]},{"given":"Amnon","family":"Lotem","sequence":"additional","affiliation":[]},{"given":"Moni","family":"Naor","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/S0022-0000(03)00026-6_BIBAF99","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1109\/90.811450","article-title":"RxW","volume":"7","author":"Aksoy","year":"1999","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"10.1016\/S0022-0000(03)00026-6_BIBBEY98","series-title":"Online Computation and Competitive Analysis","author":"Borodin","year":"1998"},{"key":"10.1016\/S0022-0000(03)00026-6_BIBBGM02","doi-asserted-by":"crossref","unstructured":"N. Bruno, L. Gravano, A. Marian, Evaluating top-k queries over web-accessible databases, in: Proceedings of the 18th International Conference on Data Engineering, IEEE Computer Society, Silver Spring, MD, 2002.","DOI":"10.1109\/ICDE.2002.994751"},{"key":"10.1016\/S0022-0000(03)00026-6_BIBCG96","doi-asserted-by":"crossref","unstructured":"S. Chaudhuri, L. Gravano, Optimizing queries over multimedia repositories, in: Proceedings of the ACM SIGMOD Conference, Montreal, 1996, pp. 91\u2013102.","DOI":"10.1145\/233269.233323"},{"key":"10.1016\/S0022-0000(03)00026-6_BIBCHS95","doi-asserted-by":"crossref","unstructured":"M.J. Carey, L.M. Haas, P.M. Schwarz, M. Arya, W.F. Cody, R. Fagin, M. Flickner, A.W. Luniewski, W. Niblack, D. Petkovic, J. Thomas, J.H. Williams, E.L. Wimmers, Towards heterogeneous multimedia information systems: the Garlic approach, in: RIDE-DOM\u201995 (5th Int'l Workshop on Research Issues in Data Engineering: Distributed Object Management), 1995, pp. 124\u2013131.","DOI":"10.1109\/RIDE.1995.378736"},{"issue":"5","key":"10.1016\/S0022-0000(03)00026-6_BIBDKLR00","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539797315306","article-title":"An optimal algorithm for Monte Carlo estimation","volume":"29","author":"Dagum","year":"2000","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(03)00026-6_BIBDLM00","unstructured":"E.D. Demaine, A. L\u00f3pez-Ortiz, J.I. Munro, Adaptive set intersections, unions, and differences, in: Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, 2000, pp. 743\u2013752."},{"key":"10.1016\/S0022-0000(03)00026-6_BIBFAG99","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1006\/jcss.1998.1600","article-title":"Combining fuzzy information from multiple systems","volume":"58","author":"Fagin","year":"1999","journal-title":"J. Comput. System Sci."},{"issue":"4","key":"10.1016\/S0022-0000(03)00026-6_BIBFHMV97","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/s004460050038","article-title":"Knowledge-based programs","volume":"10","author":"Fagin","year":"1997","journal-title":"Distributed Comput."},{"key":"10.1016\/S0022-0000(03)00026-6_BIBFMRW85","doi-asserted-by":"crossref","unstructured":"F.E. Fich, F. Meyer auf der Heide, P. Ragde, A. Wigderson, One, two, three ... infinity: lower bounds for parallel computation, in: Proceedings of the 17th ACM Symposium on Theory of Computing (STOC), Providence, 1985, pp. 48\u201358.","DOI":"10.1145\/22145.22151"},{"key":"10.1016\/S0022-0000(03)00026-6_BIBGBK00","unstructured":"U. G\u00fcntzer, W.-T. Balke, W. Kiessling, Optimizing multi-feature queries in image databases, in: Proceedings of the 26th Very Large Databases (VLDB) Conference, Cairo, Egypt, 2000, pp. 419\u2013428."},{"key":"10.1016\/S0022-0000(03)00026-6_BIBGBK01","doi-asserted-by":"crossref","unstructured":"U. G\u00fcntzer, W.-T. Balke, W. Kiessling, Towards efficient multi-feature queries in heterogeneous environments, in: Proceedings of the IEEE International Conference on Information Technology: Coding and Computing (ITCC 2001), Las Vegas, USA, April 2001.","DOI":"10.1109\/ITCC.2001.918866"},{"key":"10.1016\/S0022-0000(03)00026-6_BIBHOC97","doi-asserted-by":"crossref","unstructured":"D.S. Hochbaum (Ed.) Approximation Algorithms for NP-Hard Problems, PWS Publishing Company, Boston, MA, 1997.","DOI":"10.1145\/261342.571216"},{"key":"10.1016\/S0022-0000(03)00026-6_BIBMR95","series-title":"Randomized Algorithms","author":"Motwani","year":"1995"},{"key":"10.1016\/S0022-0000(03)00026-6_BIBNBE93","doi-asserted-by":"crossref","unstructured":"W. Niblack, R. Barber, W. Equitz, M. Flickner, E. Glasman, D. Petkovic, P. Yanker, The QBIC project: querying images by content using color, texture and shape, in: SPIE Conference on Storage and Retrieval for Image and Video Databases, Vol. 1908, 1993, pp. 173\u2013187. QBIC Web server is http:\/\/wwwqbic.almaden.ibm.com\/.","DOI":"10.1117\/12.143648"},{"key":"10.1016\/S0022-0000(03)00026-6_BIBNCS01","unstructured":"A. Natsev, Y.-C. Chang, J.R. Smith, C.-S. Li, J.S. Vitter, Supporting incremental join queries on ranked inputs, in: Proceedings of the 27th Very Large Databases (VLDB) Conference, Rome, Italy, 2001, pp. 281\u2013290."},{"key":"10.1016\/S0022-0000(03)00026-6_BIBNR99","doi-asserted-by":"crossref","unstructured":"S. Nepal, M.V. Ramakrishna, Query processing issues in image (multimedia) databases, in: Proceedings of the 15th International Conference on Data Engineering (ICDE), March 1999, pp. 22\u201329.","DOI":"10.1109\/ICDE.1999.754894"},{"key":"10.1016\/S0022-0000(03)00026-6_BIBSAL89","series-title":"Automatic Text Processing, the Transformation, Analysis and Retrieval of Information by Computer","author":"Salton","year":"1989"},{"key":"10.1016\/S0022-0000(03)00026-6_BIBST85","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","article-title":"Amortized efficiency of list update and paging rules","volume":"28","author":"Sleator","year":"1985","journal-title":"Comm. ACM"},{"key":"10.1016\/S0022-0000(03)00026-6_BIBWHRB99","doi-asserted-by":"crossref","unstructured":"E.L. Wimmers, L.M. Haas, M. Tork Roth, C. Braendli, Using Fagin's algorithm for merging ranked results in multimedia middleware, in: Fourth IFCIS International Conference on Cooperative Information Systems, IEEE Computer Society Press, Silver Spring, September 1999, pp. 267\u2013278.","DOI":"10.1109\/COOPIS.1999.792176"},{"key":"10.1016\/S0022-0000(03)00026-6_BIBYAO77","doi-asserted-by":"crossref","unstructured":"A.C.-C. Yao, Probabilistic computations: towards a unified measure of complexity, in: Proceedings of the 17th IEEE Symposium on Foundations of Computer Science, Providence 1977.","DOI":"10.1109\/SFCS.1977.24"},{"key":"10.1016\/S0022-0000(03)00026-6_BIBZAD69","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1016\/S0019-9958(65)90241-X","article-title":"Fuzzy sets","volume":"8","author":"Zadeh","year":"1969","journal-title":"Inform. Control"},{"key":"10.1016\/S0022-0000(03)00026-6_BIBZIM96","series-title":"Fuzzy Set Theory","author":"Zimmermann","year":"1996"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000266?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000266?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T21:47:47Z","timestamp":1584654467000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000003000266"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S0022000003000266"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(03)00026-6","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}