{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:00:43Z","timestamp":1725516043844},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540690450"},{"type":"electronic","value":"9783540690528"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69052-8_39","type":"book-chapter","created":{"date-parts":[[2008,7,31]],"date-time":"2008-07-31T06:38:03Z","timestamp":1217486283000},"page":"369-378","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Handling of Relational Database Combinatorial Queries Using CSPs"],"prefix":"10.1007","author":[{"given":"Malek","family":"Mouhoub","sequence":"first","affiliation":[]},{"given":"Chang","family":"Feng","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"39_CR1","unstructured":"Atzeni, P., Antonellis, V.D.: Relational database theory. Benjamin-Cummings Publishing Co (1993)"},{"key":"39_CR2","unstructured":"Liu, C., Foster, I.T.: A framework and algorithms for applying constraint solving within relational databases. In: W(C)LP 2005, pp. 147\u2013158 (2005)"},{"key":"39_CR3","volume-title":"Introduction to Constraint Databases","author":"P. Revesz","year":"2002","unstructured":"Revesz, P.: Introduction to Constraint Databases. Springer, New York (2002)"},{"key":"39_CR4","doi-asserted-by":"crossref","unstructured":"Chuang, L., Yang, L., Foster, I.T.: Efficient relational joins with arithmetic constraints on multiple attributes. In: IDEAS, pp. 210\u2013220 (2005)","DOI":"10.1109\/IDEAS.2005.24"},{"key":"39_CR5","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: The complexity of relational query languages. In: Annual ACM Symposium on Theory of Computing (1982)","DOI":"10.1145\/800070.802186"},{"key":"39_CR6","doi-asserted-by":"crossref","unstructured":"Chandra, A.: Structure and complexity of relational queries. In: The 21st IEEE Symposium, pp. 333\u2013347 (1980)","DOI":"10.1109\/SFCS.1980.41"},{"key":"39_CR7","volume-title":"Constraint Processing","author":"R. Dechter","year":"2003","unstructured":"Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)"},{"key":"39_CR8","volume-title":"Constraint Satisfaction in Logic Programming","author":"P.V. Hentenryck","year":"1989","unstructured":"Hentenryck, P.V.: Constraint Satisfaction in Logic Programming. MIT Press, Cambridge (1989)"},{"key":"39_CR9","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"R. Haralick","year":"1980","unstructured":"Haralick, R., Elliott, G.: Increasing tree search efficiency for Constraint Satisfaction Problems. Artificial Intelligence\u00a014, 263\u2013313 (1980)","journal-title":"Artificial Intelligence"},{"key":"39_CR10","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0004-3702(85)90041-4","volume":"25","author":"A.K. Mackworth","year":"1985","unstructured":"Mackworth, A.K., Freuder, E.: The complexity of some polynomial network-consistency algorithms for constraint satisfaction problems. Artificial Intelligence\u00a025, 65\u201374 (1985)","journal-title":"Artificial Intelligence"},{"key":"39_CR11","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"A.K. Mackworth","year":"1977","unstructured":"Mackworth, A.K.: Consistency in networks of relations. Artificial Intelligence\u00a08, 99\u2013118 (1977)","journal-title":"Artificial Intelligence"},{"key":"39_CR12","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: Constraint sastisfaction and database theory: A tutorial. In: PODS 2000 (2000)","DOI":"10.1145\/335168.335209"},{"key":"39_CR13","doi-asserted-by":"crossref","unstructured":"Swami, A.: Optimization of large join queries: combining heuristics and combinatorial techniques. In: The 1989 ACM SIGMOD international conference on Management of data, pp. 367\u2013376 (1989)","DOI":"10.1145\/67544.66961"},{"key":"39_CR14","doi-asserted-by":"crossref","unstructured":"Jarke, M., Koch, J.: Query optimization in database systems. In: ACM Computing Surveys (CSUR), pp. 111\u2013152 (1984)","DOI":"10.1145\/356924.356928"},{"key":"39_CR15","doi-asserted-by":"crossref","unstructured":"Miguel, I., Shen, Q.: Solution techniques for constraint satisfaction problems: Foundations. Artificial Intelligence Review 15(4) (2001)","DOI":"10.1023\/A:1011096320004"},{"key":"39_CR16","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0004-3702(86)90083-4","volume":"28","author":"R. Mohr","year":"1986","unstructured":"Mohr, R., Henderson, T.: Arc and path consistency revisited. Artificial Intelligence\u00a028, 225\u2013233 (1986)","journal-title":"Artificial Intelligence"},{"key":"39_CR17","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0004-3702(94)90041-8","volume":"65","author":"C. Bessi\u00e8re","year":"1994","unstructured":"Bessi\u00e8re, C.: Arc-consistency and arc-consistency again. Artificial Intelligence\u00a065, 179\u2013190 (1994)","journal-title":"Artificial Intelligence"},{"key":"39_CR18","unstructured":"Bessi\u00e8re, C., Freuder, E., Regin, J.: Using inference to reduce arc consistency computation. In: IJCAI 1995, Montr\u00e9al, Canada, pp. 592\u2013598 (1995)"},{"key":"39_CR19","unstructured":"Zhang, Y., Yap, R.H.C.: Making ac-3 an optimal algorithm. In: Seventeenth International Joint Conference on Artificial Intelligence (IJCAI 2001), Seattle, WA, pp. 316\u2013321 (2001)"},{"key":"39_CR20","unstructured":"Bessi\u00e8re, C., R\u00e9gin, J.C.: Refining the basic constraint propagation algorithm. In: Seventeenth International Joint Conference on Artificial Intelligence (IJCAI 2001), Seattle, WA, pp. 309\u2013315 (2001)"},{"key":"39_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/11889205_22","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"C. Lecoutre","year":"2006","unstructured":"Lecoutre, C., Radoslaw, S.: Generalized arc consistency for positive table constraints. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 284\u2013298. Springer, Heidelberg (2006)"},{"key":"39_CR22","unstructured":"Lecoutre, C., Vion, J.: Bound consistencies for the csp. In: Proceeding of the second international workshop Constraint Propagation And Implementation (CPAI 2005) held with the 10th International Conference on Principles and Practice of Constraint Programming (CP 2005), Sitges, Spain (September 2005)"},{"key":"39_CR23","unstructured":"Mackworth, A.K.: On reading sketch maps. In: IJCAI 1977, pp. 598\u2013606 (1977)"},{"key":"39_CR24","doi-asserted-by":"crossref","unstructured":"Sabin, D., Freuder, E.C.: Contradicting conventional wisdom in constraint satisfaction. In: Proc. 11th ECAI, Amsterdam, Holland, pp. 125\u2013129 (1994)","DOI":"10.1007\/3-540-58601-6_86"}],"container-title":["Lecture Notes in Computer Science","New Frontiers in Applied Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69052-8_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:23:22Z","timestamp":1620015802000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69052-8_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540690450","9783540690528"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69052-8_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}