{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:56:06Z","timestamp":1725562566552},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221265"},{"type":"electronic","value":"9783540259541"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25954-1_9","type":"book-chapter","created":{"date-parts":[[2010,8,8]],"date-time":"2010-08-08T17:35:31Z","timestamp":1281288931000},"page":"143-160","source":"Crossref","is-referenced-by-count":2,"title":["Constraint Processing Techniques for Improving Join Computation: A Proof of Concept"],"prefix":"10.1007","author":[{"given":"Anagh","family":"Lal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Berthe Y.","family":"Choueiry","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Dittrich, J.P., Seeger, B., Taylor, D.S., Widmayer, P.: On Producing Join Results Early. In: 22nd ACM Symposium on Principles of Database Systems, pp. 134\u2013142 (2003)","DOI":"10.1145\/773153.773167"},{"key":"9_CR2","unstructured":"den Bercken, J.V., Blohsfeld, B., Dittrich, J.P., Kr\u00e4mer, J., Sch\u00e4fer, T., Schneider, M., Seeger, B.: XXL\u2013A Library Approach to Supporting Efficient Implementations of Advanced Database Queries. In: 27th International Conference on Very Large Data Bases, pp. 39\u201348 (2001)"},{"key":"9_CR3","unstructured":"Rossi, F., Petrie, C., Dhar, V.: On the Equivalence of Constraint Satisfaction Problems. In: Proc. of the 9th ECAI, Stockholm, Sweden, pp. 550\u2013556 (1990)"},{"key":"9_CR4","unstructured":"Bacchus, F., van Beek, P.: On the Conversion between Non-Binary and Binary Constraint Satisfaction Problems Using the Hidden Variable Method. In: Proc. of AAAI 1998, Madison, Wisconsin, pp. 311\u2013318 (1998)"},{"issue":"1-2","key":"9_CR5","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0004-3702(02)00263-1","volume":"141","author":"C. Bessi\u00e8re","year":"2002","unstructured":"Bessi\u00e8re, C., Meseguer, P., Freuder, E.C., Larrosa, J.: On Forward Checking for Non-binary Constraint Satisfaction. Artificial Intelligence\u00a0141(1-2), 205\u2013224 (2002)","journal-title":"Artificial Intelligence"},{"key":"9_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/3-540-45656-2_5","volume-title":"AI 2001: Advances in Artificial Intelligence","author":"A.M. Beckwith","year":"2001","unstructured":"Beckwith, A.M., Choueiry, B.Y., Zou, H.: How the Level of Interchangeability Embedded in a Finite Constraint Satisfaction Problem Affects the Performance of Search. In: Stumptner, M., Corbett, D.R., Brooks, M. (eds.) Canadian AI 2001. LNCS (LNAI), vol.\u00a02256, pp. 50\u201361. Springer, Heidelberg (2001)"},{"key":"9_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/3-540-45622-8_6","volume-title":"Abstraction, Reformulation, and Approximation","author":"B.Y. Choueiry","year":"2002","unstructured":"Choueiry, B.Y., Davis, A.M.: Dynamic Bundling: Less Effort for More Solutions. In: Koenig, S., Holte, R. (eds.) SARA 2002. LNCS (LNAI), vol.\u00a02371, pp. 64\u201382. Springer, Heidelberg (2002)"},{"key":"9_CR8","unstructured":"Lal, A., Choueiry, B.Y.: Dynamic Detection and Exploitation of Value Symmetries for Non-Binary Finite CSPs. In: Third International Workshop on Symmetry in Constraint Satisfaction Problems (SymCon 2003), Kinsale, County Cork, Ireland, pp. 112\u2013126 (2003)"},{"key":"9_CR9","unstructured":"Freuder, E.C.: Eliminating Interchangeable Values in Constraint Satisfaction Problems. In: Proc. of AAAI, Anaheim, CA, pp. 227\u2013233 (1991)"},{"key":"9_CR10","unstructured":"Haselb\u00f6ck, A.: Exploiting Interchangeabilities in Constraint Satisfaction Problems. In: Proc. of the 13th IJCAI, Chamb\u00e9ry, France, pp. 282\u2013287 (1993)"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/163090.163096","volume":"22","author":"M.A. Roth","year":"1993","unstructured":"Roth, M.A., Horn, S.J.V.: Database compression. SIGMOD Record\u00a022, 31\u201339 (1993)","journal-title":"SIGMOD Record"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1145\/362084.362137","volume":"29","author":"T. Westmann","year":"2000","unstructured":"Westmann, T., Kossmann, D., Helmer, S., Moerkotte, G.: The implementation and performance of compressed databases. SIGMOD Record\u00a029, 55\u201367 (2000)","journal-title":"SIGMOD Record"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Chen, Z., Gehrke, J., Korn, F.: Query optimization in compressed database systems. In: ACM International Conference on Management of Data (SIGMOD), pp. 271\u2013282 (2001)","DOI":"10.1145\/375663.375692"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Mamoulis, N., Papadias, D.: Constraint-based Algorithms for Computing Clique Intersection Joins. In: Sixth ACM International Symposium on Advances in Geographic Information Systems, pp. 118\u2013123 (1998)","DOI":"10.1145\/288692.288714"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/322234.322238","volume":"28","author":"P.A. Bernstein","year":"1981","unstructured":"Bernstein, P.A., Chiu, D.M.W.: Using semi-joins to solve relational queries. J. ACM\u00a028, 25\u201340 (1981)","journal-title":"J. ACM"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","first-page":"148","volume-title":"Constraint Databases and Applications","author":"M. Wallace","year":"1995","unstructured":"Wallace, M., Bressan, S., Provost, T.L.: Magic checking: Constraint checking for database query optimization. In: Kuper, G.M., Wallace, M. (eds.) CONTESSA-WS 1995 and CDB 1995. LNCS, vol.\u00a01034, pp. 148\u2013166. Springer, Heidelberg (1995)"},{"key":"9_CR17","unstructured":"Bayardo, R.J.: Processing Multi-Join Queries. PhD thesis, University of Texas, Austin (1996)"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","first-page":"53","volume-title":"Constraint Databases and Applications","author":"D.P. Miranker","year":"1997","unstructured":"Miranker, D.P., Bayardo, R.J., Samoladas, V.: Query evaluation as constraint search; an overview of early results. In: Gaede, V., Vianu, V., Brodsky, A., Srivastava, D., G\u00fcnther, O., Wallace, M. (eds.) CP-WS 1996 and CDB 1997. LNCS, vol.\u00a01191, pp. 53\u201363. Springer, Heidelberg (1997)"},{"key":"9_CR19","unstructured":"Rich, C., Rosenthal, A., Scholl, M.H.: Reducing duplicate work in relational join(s): A unified approach. In: International Conference on Information Systems and Management of Data, pp. 87\u2013102 (1993)"},{"key":"9_CR20","volume-title":"Introduction to Constraint Databases","author":"P. Revesz","year":"2001","unstructured":"Revesz, P.: Introduction to Constraint Databases. Springer, New York (2001)"}],"container-title":["Lecture Notes in Computer Science","Constraint Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25954-1_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:18:46Z","timestamp":1619997526000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-25954-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221265","9783540259541"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25954-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}