{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T11:40:06Z","timestamp":1747654806203,"version":"3.40.5"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Heuristics"],"published-print":{"date-parts":[[1997,3]]},"DOI":"10.1023\/a:1009670031749","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T22:47:08Z","timestamp":1040597228000},"page":"5-23","source":"Crossref","is-referenced-by-count":8,"title":["Query Optimization in Distributed Relational Databases"],"prefix":"10.1007","volume":"3","author":[{"given":"Celso C.","family":"Ribeiro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cl\u00e1udio D.","family":"Ribeiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rosana S.G.","family":"Lanzelotte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"138122_CR1","volume-title":"Foundations of Computer Science","author":"A.V. Aho","year":"1992","unstructured":"Aho, A.V. and J.D. Ullman. (1992). Foundations of Computer Science. New York: W.H. Freeman and Company."},{"key":"138122_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02085633","volume":"50","author":"A.A. Andreatta","year":"1994","unstructured":"Andreatta, A.A. and C.C. Ribeiro. (1994). \u201cA Graph Partitioning Heuristic for the Parallel Pseudo-Exhaustive Logical Test of VLSI Combinational Circuits.\u201d Annals of Operations Research 50, 1\u201336.","journal-title":"Annals of Operations Research"},{"key":"138122_CR3","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1287\/ijoc.6.2.126","volume":"6","author":"R. Battiti","year":"1994","unstructured":"Battiti, R. and G. Tecchiolli. (1994). \u201cThe Reactive Tabu Search.\u201d ORSA Journal on Computing 6, 126\u2013140.","journal-title":"ORSA Journal on Computing"},{"key":"138122_CR4","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF02618466","volume":"9","author":"S.G. de Amorim","year":"1992","unstructured":"de Amorim, S.G., J.-P. Barthel\u00e9my, and C.C. Ribeiro. (1992). \u201cClustering and Clique Partitioning: Simulated Annealing and Tabu Search Approaches.\u201d Journal of Classification 9, 17\u201341.","journal-title":"Journal of Classification"},{"key":"138122_CR5","unstructured":"EDS Database Group: \u201cEDS-Collaborating for a High-Performance Parallel Relational Database.\u201d ESPRIT Conference, Brussels, 1990."},{"key":"138122_CR6","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF02243141","volume":"42","author":"C. Friden","year":"1989","unstructured":"Friden, C., A. Hertz, and D. deWerra. (1989). \u201cSTABULUS: A Technique for Finding Stable Sets in Large Graphs with Tabu Search.\u201d Computing 42, 35\u201344.","journal-title":"Computing"},{"key":"138122_CR7","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1038\/scientificamerican0676-120","volume":"234","author":"M. Gardner","year":"1976","unstructured":"Gardner, M. (1976). \u201cMathematical Games, Catalan Numbers: An Integer Sequence that Materializes in Unexpected Places.\u201d Scientific American 234, 120\u2013125.","journal-title":"Scientific American"},{"key":"138122_CR8","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F. (1989). \u201cTabu Search. Part I.\u201d ORSA Journal on Computing 1, 190\u2013206.","journal-title":"ORSA Journal on Computing"},{"key":"138122_CR9","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"Glover, F. (1990a). \u201cTabu Search. Part II.\u201d ORSA Journal on Computing 2, 4\u201332.","journal-title":"ORSA Journal on Computing"},{"key":"138122_CR10","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1287\/inte.20.4.74","volume":"20","author":"F. Glover","year":"1990","unstructured":"Glover, F. (1990b). \u201cTabu Search: A Tutorial.\u201d Interfaces 20, 74\u201394.","journal-title":"Interfaces"},{"key":"138122_CR11","unstructured":"Glover, F. (1995). \u201cTabu Search Fundamentals and Uses.\u201dWorking paper, University of Colorado, Graduate School of Business."},{"key":"138122_CR12","unstructured":"Glover, F. and M. Laguna. (1993). \u201cTabu Search.\u201d Chapter 3 in C.R. Reeves (ed.), Modern Heuristic Techniques for Combinatorial Problems, Blackwell Scientific Publications, pp. 70\u2013150."},{"key":"138122_CR13","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02078647","volume":"41","author":"F. Glover","year":"1993","unstructured":"Glover, F., E. Taillard, and D. deWerra. (1993). \u201cA User's Guide to Tabu Search.\u201d Annals of Operations Research 41, 3\u201328.","journal-title":"Annals of Operations Research"},{"key":"138122_CR14","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01531072","volume":"1","author":"P. Hansen","year":"1990","unstructured":"Hansen, P., M.V. Poggi de Arag\u00e3o, and C.C. Ribeiro. (1990). \u201cBoolean Query Optimization and the 0-1 Hyperbolic Sum Problem.\u201d Annals of Mathematics and Artificial Intelligence 1, 97\u2013109.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"138122_CR15","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/0377-2217(92)90207-P","volume":"58","author":"P. Hansen","year":"1992","unstructured":"Hansen, P., E.L. Pedrosa Filho, and C.C. Ribeiro. (1992). \u201cLocation and Sizing of Off-Shore Platforms for Oil Exploration.\u201d European Journal of Operational Research 58, 202\u2013214.","journal-title":"European Journal of Operational Research"},{"key":"138122_CR16","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF02239976","volume":"29","author":"A. Hertz","year":"1987","unstructured":"Hertz, A. and D. deWerra. (1987). \u201cUsing Tabu Search Techniques for Graph Coloring.\u201d Computing 29, 345\u2013351.","journal-title":"Computing"},{"key":"138122_CR17","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01531073","volume":"1","author":"A. Hertz","year":"1990","unstructured":"Hertz, A. and D. de Werra. (1990). \u201cThe Tabu Search Metaheuristic: How We Used it.\u201d Annals of Mathematics and Artificial Intelligence 1, 111\u2013121.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"138122_CR18","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1145\/1270.1498","volume":"9","author":"T. Ibaraki","year":"1984","unstructured":"Ibaraki, T. and T. Kameda. (1984). \u201cOn the Optimal Nesting Order for Computing N-Relational Joins.\u201d ACM Transactions on Data Bases 9, 482\u2013541.","journal-title":"ACM Transactions on Data Bases"},{"key":"138122_CR19","doi-asserted-by":"crossref","unstructured":"Ioannidis, Y.E. and E. Wong. (1987). \u201cQuery Optimization by Simulated Annealing.\u201d Proceedings of the ACM SIGMOD International Conference on Management of Data, San Francisco, pp. 9\u201322.","DOI":"10.1145\/38713.38722"},{"key":"138122_CR20","doi-asserted-by":"crossref","unstructured":"Ioannidis, Y.E. and Y. Kang. (1991). \u201cLeft-deep vs. Bushy Trees: An Analysis of Strategy Spaces and Its Implications for Query Optimization.\u201d Proceedings of the ACM SIGMOD International Conference on Management of Data.","DOI":"10.1145\/115790.115813"},{"key":"138122_CR21","unstructured":"Lanzelotte, R.S.G. and P. Valduriez. (1991). \u201cExtending the Search Strategy in a Query Optimizer.\u201d Proceedings of the 17th International Conference on Very Large Data Bases, Barcelona, pp. 363\u2013373."},{"key":"138122_CR22","doi-asserted-by":"crossref","unstructured":"Lanzelotte, R.S.G., P. Valduriez, and M. Za\u00ef t. (1992). \u201cOptimization of Object-oriented Recursive Queries using Cost-Controlled Strategies.\u201d Proceedings of the ACM SIGMOD International Conference on Management of Data, San Diego, pp. 256\u2013265.","DOI":"10.1145\/130283.130322"},{"key":"138122_CR23","unstructured":"Lanzelotte, R.S.G., P. Valduriez, and M. Za\u00ef t. (1993). \u201cOn the Effectiveness of Optimization Search Strategies.\u201d In Proc. 19th Int. Conf. on Very Large Data Bases, Dublin, pp. 493\u2013504."},{"key":"138122_CR24","doi-asserted-by":"crossref","unstructured":"Morzy, T., M. Matysiak, and S. Salza. (1994). \u201cTabu Search Optimization of Large Join Queries.\u201d Proceedings of the Fourth International Conference on Extending Database Technology (EDBT'94), Cambridge, pp. 309\u2013322.","DOI":"10.1007\/3-540-57818-8_60"},{"key":"138122_CR25","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1142\/S012905339500004X","volume":"7","author":"S.C. Porto","year":"1995","unstructured":"Porto, S.C. and C.C. Ribeiro. (1995). \u201cA Tabu Search Approach to Task Scheduling on Heterogeneous Processors under Precedence Constraints.\u201d International Journal of High Speed Computing 7, 45\u201371.","journal-title":"International Journal of High Speed Computing"},{"key":"138122_CR26","doi-asserted-by":"crossref","unstructured":"Selinger, P.G., M.M. Astrahan, D.D. Chamberlin, R.A. Lorie, and T.G. Price. (1979). \u201cAccess Path Selection in a Relational Data Base System.\u201d Proceedings of the ACM SIGMOD International Conference on Management of Data, Boston, pp. 23\u201334.","DOI":"10.1145\/582095.582099"},{"key":"138122_CR27","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1287\/ijoc.2.1.33","volume":"2","author":"J. Skorin-Kapov","year":"1990","unstructured":"Skorin-Kapov, J. (1990). \u201cTabu Search Applied to the Quadratic Assignment Problem.\u201d ORSA Journal on Computing 2, 33\u201345.","journal-title":"ORSA Journal on Computing"},{"key":"138122_CR28","doi-asserted-by":"crossref","unstructured":"Swami, A. (1989). \u201cOptimization of Large Join Queries: Combining Heuristics and Combinatorial Techniques.\u201d Proceedings of the ACM SIGMOD International Conference on Management of Data, Portland, pp. 367\u2013376.","DOI":"10.1145\/67544.66961"},{"key":"138122_CR29","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/0377-2217(89)90383-4","volume":"41","author":"M. Widmer","year":"1989","unstructured":"Widmer, M. and A. Hertz. (1989). \u201cA New Approach for Solving the Flow Shop Sequencing Problem.\u201d European Journal of Operational Research 41, 186\u2013193.","journal-title":"European Journal of Operational Research"},{"key":"138122_CR30","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF02022565","volume":"41","author":"D.L. Woodruff","year":"1993","unstructured":"Woodruff, D.L. and E. Zemel. (1993). \u201cHashing Vectors for Tabu Search.\u201d Annals of Operations Research 41, 123\u2013137.","journal-title":"Annals of Operations Research"},{"key":"138122_CR31","unstructured":"Za\u00eft, M. (1994). Optimisation de Requ\u00eates Relationnelles pour Ex\u00e9cution Parall\u00e8le, Doctorate dissertation, Universit \u00e9 de Paris VI."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009670031749.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009670031749\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009670031749.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T11:02:09Z","timestamp":1747652529000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009670031749"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["138122"],"URL":"https:\/\/doi.org\/10.1023\/a:1009670031749","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}