乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T06:03:22Z","timestamp":1648793002250},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2005,2,2]],"date-time":"2005-02-02T00:00:00Z","timestamp":1107302400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2005,9]]},"DOI":"10.1007\/s10115-004-0189-y","type":"journal-article","created":{"date-parts":[[2005,2,1]],"date-time":"2005-02-01T16:29:28Z","timestamp":1107275368000},"page":"350-373","source":"Crossref","is-referenced-by-count":6,"title":["Optimizing complex queries based on similarities of subqueries"],"prefix":"10.1007","volume":"8","author":[{"given":"Qiang","family":"Zhu","sequence":"first","affiliation":[]},{"given":"Yingying","family":"Tao","sequence":"additional","affiliation":[]},{"given":"Calisto","family":"Zuzarte","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,2,2]]},"reference":[{"key":"189_CRBennett91ga","unstructured":"Bennett K, Ferris MC, Ioannidis Y (1991) A genetic algorithm for database query optimization. In: Proceedings of 4th international conference on genetic algorithms, pp 400\u2013407"},{"key":"189_CRChaudhuri98acm","doi-asserted-by":"crossref","unstructured":"Chaudhuri S (1998) An overview of query optimization in relational systems. In: Proceedings of ACM symposium on principles of database systems (PODS), pp 34\u201343","DOI":"10.1145\/275487.275492"},{"key":"189_CRChesnais84cacm","doi-asserted-by":"crossref","unstructured":"Chesnais A, Gelenbe E, Mitrani I (1983) On the modeling of parallel access to shared data. In: Commun ACM 26(3):196\u2013202","DOI":"10.1145\/358061.358073"},{"key":"189_CRCosar93cikm","doi-asserted-by":"crossref","unstructured":"Cosar A, Lim EP, Srivastava J (1993) Multiple query optimization with depth-first branch-and-bound and dynamic query ordering. In: Proceedings of international conference on information and knowledge management (CIKM), pp 433\u2013438","DOI":"10.1145\/170088.170181"},{"key":"189_CRDalvi01pods","doi-asserted-by":"crossref","unstructured":"Dalvi NN, Sanghai SK, Roy P, et al (2001) Pipelining in multi-query optimization. In: Proceedings of ACM symposium on principles of database systems (PODS), pp 59\u201370","DOI":"10.1145\/375551.375561"},{"key":"189_CRDalvi03jcss","doi-asserted-by":"crossref","unstructured":"Dalvi NN, Sanghai SK, Roy P, et al (2003) Pipelining in multi-query optimization. In: J Comput Syst Sci 66(4):728\u2013762","DOI":"10.1016\/S0022-0000(03)00031-X"},{"key":"189_CRGraefe93acm","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1145\/152610.152611","volume":"25","author":"Graefe","year":"1993","unstructured":"Graefe G (1993) Query evaluation techniques for large databases. ACM Comput Surv 25(2):111\u2013152","journal-title":"ACM Comput Surv"},{"key":"189_CRIbaraki84acm","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1145\/1270.1498","volume":"9","author":"Ibarake","year":"1984","unstructured":"Ibarake T, Kameda T (1984) On the optimal nesting order for computing N-relational joins. ACM Trans Database Syst 9(3):482\u2013502","journal-title":"ACM Trans Database Syst"},{"key":"189_CRIoannidis87acmsigmod","doi-asserted-by":"crossref","unstructured":"Ioannidis YE, Wong E (1987) Query optimization by simulated annealing. In: Proceedings of ACM international conference on management of data (SIGMOD), pp 9\u201322","DOI":"10.1145\/38713.38722"},{"key":"189_CRJarke84acmcs","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1145\/356924.356928","volume":"16","author":"Jarke","year":"1984","unstructured":"Jarke M, Koch J (1984) Query optimization in database systems. ACM Computing Surveys 16(2):111\u2013152","journal-title":"ACM Computing Surveys"},{"key":"189_CRKalnis03is","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/S0306-4379(02)00026-1","volume":"28","author":"Kalnis","year":"2003","unstructured":"Kalnis P, Papadias D (2003) Multi-query optimization for on-line analytical processing. Inf Syst 28(5):457\u2013473","journal-title":"Inf Syst"},{"key":"189_CRKrolikowski00advis","doi-asserted-by":"crossref","unstructured":"Krolikowski Z, Morzy T, Bebel B (2000) Comparison of genetic and tabu search algorithms in multiquery optimization in advanced database systems. In: Proceedings of international conference on advances in information systems (ADVIS). Lecture notes in computer science, Vol 1909. Springer, Berlin Heidelberg, New York, pp 117\u2013126","DOI":"10.1007\/3-540-40888-6_11"},{"key":"189_CRMatysiak95is","doi-asserted-by":"crossref","unstructured":"Matysiak M (1995) Efficient optimization of large join queries using tabu search. Inf Sci 83(1\u20132):77\u201388","DOI":"10.1016\/0020-0255(94)00094-R"},{"key":"189_CRMistry01sigmod","doi-asserted-by":"crossref","unstructured":"Mistry H, Roy P, Sudarshan S, et al (2001) Materialized view selection and maintenance using multi-query optimization. In: Proceedings of ACM international conference on management of data (SIGMOD), pp 307\u2013318","DOI":"10.1145\/375663.375703"},{"key":"189_CROgorman02icde","doi-asserted-by":"crossref","unstructured":"O\u2019Gorman K, Agrawal D, Abbadi AE (2002) Multiple query optimization by cache-aware middleware using query teamwork. In: Proceedings of IEEE international conference on data engineering (ICDE), pp 274","DOI":"10.1109\/ICDE.2002.994728"},{"key":"189_CRSelinger79acmsigmod","doi-asserted-by":"crossref","unstructured":"Selinger PG, Astrahan MM, Chanmberling DD, et al (1979) Access path selection in a relational database management system. In: Proceedings of ACM international conference on management of data (SIGMOD), pp 23\u201334","DOI":"10.1145\/582095.582099"},{"key":"189_CRSwami88acmsigmod","doi-asserted-by":"crossref","unstructured":"Swami A, Gupta A (1988) Optimization of large join queries. In: Proceedings of ACM international conference on management of data (SIGMOD), pp 8\u201317","DOI":"10.1145\/50202.50203"},{"key":"189_CRSwami93ieee","doi-asserted-by":"crossref","unstructured":"Swami A, Iyer BR (1993) A polynomial time algorithm for optimizing join queries. In: Proceedings of the 9th IEEE conference on data engineering (ICDE), pp 345\u2013354","DOI":"10.1109\/ICDE.1993.344047"},{"key":"189_CRtao2002cas","unstructured":"Tao Y, Zhu Q, Zuzarte C (2002) Exploiting common subqueries for complex query optimization. In: Proceedings of the 2002 CAS conference (CASCON), pp 21\u201334"},{"key":"189_CRtao2003dexa","doi-asserted-by":"crossref","unstructured":"Tao Y, Zhu Q, Zuzarte C (2003) Exploiting similarity of subqueries for complex query optimization. In: Proceedings of the 14th international conference on database and expert systems applications, pp 747\u2013759","DOI":"10.1007\/978-3-540-45227-0_73"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-004-0189-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-004-0189-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-004-0189-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T10:10:14Z","timestamp":1559124614000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-004-0189-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,2,2]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,9]]}},"alternative-id":["189"],"URL":"https:\/\/doi.org\/10.1007\/s10115-004-0189-y","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,2,2]]}}}