{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T09:06:48Z","timestamp":1649149608307},"reference-count":18,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Software Technology"],"published-print":{"date-parts":[[1997,3]]},"DOI":"10.1016\/s0950-5849(96)01133-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:22:28Z","timestamp":1027606948000},"page":"149-169","source":"Crossref","is-referenced-by-count":0,"title":["Distributed query optimization using two-step pruning"],"prefix":"10.1016","volume":"39","author":[{"given":"Hyeokman","family":"Kim","sequence":"first","affiliation":[]},{"given":"Sukho","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Hyoung-Joo","family":"Kim","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0950-5849(96)01133-0_BIB1","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1137\/0213009","article-title":"Optimizing chain queries in a distributed database system","volume":"13","author":"Chiu","year":"1984","journal-title":"SIAM Journal of Computing"},{"key":"10.1016\/S0950-5849(96)01133-0_BIB2","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1145\/6314.6460","article-title":"A state transition model for distributed query processing","volume":"11","author":"Lafortune","year":"1986","journal-title":"ACM Transactions on Database Systems"},{"key":"10.1016\/S0950-5849(96)01133-0_BIB3","article-title":"Query processing in R\u2217","author":"Lohman","year":"1984","journal-title":"IBM Research Report RJ4272"},{"key":"10.1016\/S0950-5849(96)01133-0_BIB4","series-title":"Proc. VLDB","first-page":"314","article-title":"Measuring the complexity of join enumeration in query optimization","author":"Ono","year":"1990"},{"key":"10.1016\/S0950-5849(96)01133-0_BIB5","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/0022-0000(84)90007-2","article-title":"Optimization of distributed tree query","volume":"29","author":"Yu","year":"1984","journal-title":"Journal of Computer and System Science"},{"key":"10.1016\/S0950-5849(96)01133-0_BIB6","first-page":"198","article-title":"Fundamentals of Computer Algorithms","author":"Horowitz","year":"1978"},{"key":"10.1016\/S0950-5849(96)01133-0_BIB7","series-title":"Proc. VLDB","first-page":"149","article-title":"R\u2217 optimizer validation and performance evaluation for distributed queries","author":"Mackert","year":"1986"},{"key":"10.1016\/S0950-5849(96)01133-0_BIB8","series-title":"Proc. ACM SIGMOD","first-page":"168","article-title":"Left-deep vs. bush trees: an analysis of strategy spaces and its implications for query optimization","author":"Ioannidis","year":"1991"},{"key":"10.1016\/S0950-5849(96)01133-0_BIB9","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1145\/319628.319650","article-title":"Query Processing in a System for Distributed Databases (SDD-1)","volume":"6","author":"Bernstein","year":"1981","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/S0950-5849(96)01133-0_BIB10","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1145\/3872.3874","article-title":"Distributed query processing","volume":"16","author":"Yu","year":"1984","journal-title":"ACM Computing Surveys"},{"key":"10.1016\/S0950-5849(96)01133-0_BIB11","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1109\/TSE.1983.236170","article-title":"Optimization algorithm for distributed queries","volume":"9","author":"Apers","year":"1983","journal-title":"IEEE Trans. Soft. Eng."},{"key":"10.1016\/S0950-5849(96)01133-0_BIB12","first-page":"563","article-title":"Querying distributed databases on Local Area Networks","volume":"75","author":"Hevner","year":"1987"},{"key":"10.1016\/S0950-5849(96)01133-0_BIB13","first-page":"230","article-title":"Principle of Distributed Database Systems","author":"Ozsu","year":"1991"},{"key":"10.1016\/S0950-5849(96)01133-0_BIB14","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1109\/TSE.1985.231857","article-title":"An optimal algorithm for processing distributed star queries","volume":"11","author":"Chen","year":"1985","journal-title":"IEEE Trans. Soft. Eng."},{"key":"10.1016\/S0950-5849(96)01133-0_BIB15","series-title":"Proc. 2nd Int. Conf. Deductive and Object-Oriented Databases","first-page":"1","article-title":"Optimization of non-recursive queries in OODBs","author":"Lanzelotte","year":"1991"},{"key":"10.1016\/S0950-5849(96)01133-0_BIB16","article-title":"Two-step pruning algorithm for distributed query optimization","author":"Kim","year":"1995","journal-title":"Technical Report DBTR-95-1"},{"key":"10.1016\/S0950-5849(96)01133-0_BIB17","first-page":"165","article-title":"Concrete Mathematics","author":"Graham","year":"1989"},{"key":"10.1016\/S0950-5849(96)01133-0_BIB18","article-title":"A study of Database 2 customer queries","author":"Tsang","year":"1991"}],"container-title":["Information and Software Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950584996011330?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950584996011330?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T18:20:26Z","timestamp":1556043626000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0950584996011330"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["S0950584996011330"],"URL":"https:\/\/doi.org\/10.1016\/s0950-5849(96)01133-0","relation":{},"ISSN":["0950-5849"],"issn-type":[{"value":"0950-5849","type":"print"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}