Partition search for non-binary constraint satisfaction

Information Sciences

Volumn 177, Issue 18, 2007, Pages 3639-3678

  Ullmann, Julian R ^a  

^a KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

BDD; Consistency; Constraint satisfaction; Decision diagram; Dual search; Forward checking; Hash join; Multijoin; Non binary constraints; Partition search; Random problems; Semijoin reduction

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; CONSTRAINT THEORY; DECISION TREES; FORWARD ERROR CORRECTION;

BLOOM FILTERING; DECISION DIAGRAMS; FORWARD CHECKING; SEARCH ALGORITHMS;

ONLINE SEARCHING;

EID: 34250748551     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2007.03.030     Document Type: Article

References (87)

1. Achlioptas D., Molloy M.S.O., Kirousis L.M., Stamatiou Y.C., Kranakis E., and Krizanc D. Random constraint satisfaction: a more accurate picture. Constraints 6 4 (2001) 329-344
2. Al-Suwaiyel M., and Horowitz E. Algorithms for trie compaction. ACM Trans. Database Syst. 9 (1984) 243-263
3. Aoe J., Morimoto K., Shishibori M., and Park K.-H. A trie compaction algorithm for a large set of keys. IEEE Trans. Data Knowledge Eng. 8 (1996) 476-491
4. Artymiuk P.J., Grindley H.M., Poirrette A.R., Rice D.W., Ujah E.C., and Willett P. Identification of β-sheet motifs, of ψ-loops and of patterns of amino-acid residues in three-dimensional protein structures using a subgraph-isomorphism algorithm. J. Chem. Inform. Comput. Sci. 34 (1994) 54-62
5. Babb E. Implementing a relational database by means of specialized hardware. ACM Trans. Database Syst. 4 (1979) 1-29
6. B. Babcock, S. Chaudhuri, Towards a robust query optimizer: a principled and practical approach, in: Proceedings ACM SIGMOD, Baltimore, MD, 2005, pp. 119-130.
7. Bacchus F., and van Run P. Dynamic variable ordering in CSPs. Lecture Notes in Computer Science vol. 976 (1995), Springer, New York pp. 258-275
8. F. Bacchus, P. van Beek, On the conversion between non-binary and binary constraint satisfaction problems, in: Proceedings of AAAI'98, Madison, WI, 1998, pp. 310-318.
9. Bacchus F., Chen X., van Beek P., and Walsh T. Binary vs. non-binary constraints. Artif. Intell. 140 (2002) 1-37
10. S. Bandyopadhyay, Q. Fu, A. Sengupta, A cyclic multi-relation semijoin operation for query optimization in distributed databases, in: Proceedings of IEEE International Conference on Performance, Computing, and Communications (IPCCC'00), 2000, pp. 101-107.
11. Beacham A., Chen X., Sillito J., and van Beek P. Constraint programming lessons learned from crossword puzzles. Lecture Notes in Computer Science vol. 2056 (2001), Springer, New York pp. 78-87
12. Bernstein P.A., and Chiu D.-M.W. Using semi-joins to solve relational queries. JACM 28 1 (1981) 25-40
13. C. Bessière, J.C. Régin, MAC and combined heuristics: two reasons to forsake FC (and CBJ?) on hard problems, in: Proceedings of CP'96, Cambridge, MA, 1996, pp. 61-75.
14. C. Bessière, J.C. Régin, Refining the basic arc consistency algorithm, in: Proceedings of IJCAI-01, Seattle, WA, 2001, pp. 309-315.
15. Bessière C., Meseguer P., Freuder E.C., and Larrosa J. On forward checking for non-binary constraint satisfaction. Artif. Intell. 141 (2002) 205-224
16. Bruno I.J., Kemp N.M., Artymiuk P.J., and Willett P. Representation and searching of carbohydrate structures using graph-theoretic techniques. Carbohyd. Res. 304 (1997) 61-67
17. Bryant R.E. Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. C-35 (1986) 677-691
18. Bryant R.E. Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Comput. Surv. 24 (1992) 293-318
19. Chen M.-S., Yu P.S., and Wu K.-L. Optimization of parallel execution for multi-join queries. IEEE Trans. Knowledge Data Eng. 8 (1996) 416-428
20. Cohen D., Jeavons P., and Gault R. New tractable classes from old. Constraints 8 (2003) 263-282
21. Comer D. Analysis of a heuristic for full trie minimization. ACM Trans. Database Syst. 6 (1981) 513-537
22. Cooper M.C. Estimating optimal parameters for parallel database hardware. Int. J. Syst. Sci. 23 (1992) 119-125
23. Debruyne R., and Bessière C. Domain filtering consistencies. J. Artif. Intell. Res. 14 (2001) 205-230
24. Dechter R. Constraint Processing (2003), Morgan Kaufman, San Fransisco
25. A. Dechter, R. Dechter, Removing redundancies in constraint networks, in: Proceedings of the AAAI-87, Seattle, WA, 1987, pp. 105-109.
26. Dechter R., and Pearl J. Network-based heuristics for constraint-satisfaction problems. Artif. Intell. 34 (1988) 1-38
27. Dechter R., and Pearl J. Tree clustering for constraint networks. Artif. Intell. 38 (1989) 253-266
28. Dechter R., and Rish I. Mini-buckets: a general scheme for bounded inference. JACM 50 (2003) 107-153
29. Dreschsler R., and Sieling D. Binary decision diagrams in theory and practice. Int. J. Software Tools Technol. Transf. 3 (2001) 112-136
30. D. Frost, R. Dechter, Look-ahead value ordering for constraint satisfaction problems, in: Proceedings of IJCAI'95, Montreal, Canada, 1995, pp. 572-578.
31. Frost D., and Dechter R. Maintenance scheduling problems as benchmarks for constraint algorithms. Ann. Math. Artif. Intell. 26 (1999) 149-170
32. A. Galindo-Legaria, Outerjoins as disjunctions, in: Proceedings of the 1994 ACM SIGMOD Conference, Minneapolis, MN, 1994, pp. 348-358.
33. Garcia-Molina H., Ullman J.D., and Widom J. Database Systems: The Complete Book (2002), Prentice Hall, Upper Saddle River, NJ
34. Gent I.P., Macintyre E., Prosser P., Smith B.M., and Walsh T. Random constraint satisfaction: flaws and structure. Constraints 6 (2001) 345-372
35. M. Ginsberg, M. Frank, M. Halpin, M. Torrance, Search lessons learned from crossword puzzles, in: Proceedings of AAAI-90, Boston, MA, 1990, pp. 210-215.
36. Golomb S.W., and Baumert L.D. Backtrack programming. JACM 12 4 (1965) 516-524
37. Gopal R.D., Ramesh R., and Zionts S. Criss-cross hash joins: design and analysis. IEEE Trans. Knowledge Data Eng. 13 4 (2001) 637-653
38. Gyssens M., Jeavons P.G., and Cohen D.A. Decomposing constraint satisfaction problems using database techniques. Artif. Intell. 66 (1994) 57-89
39. T. Hadzic, S. Subbarayan, R.M. Jensen, H.R. Andersen, J. Møller, H. Hulgaard, Fast backtrack-free product configuration using a precompiled solution space representation, in: Proceedings of International Conference on Economic, Technical and Organisational Aspects of Product Configuration Systems, Copenhagen, 2004, pp. 131-138.
40. Haralick R.M., Davis L.S., Rosenfeld A., and Milgram D.L. Reduction operations for constraint satisfaction. Inform. Sci. 14 (1978) 199-219
41. Haralick R.M., and Elliott G.L. Increasing tree search efficiency for constraint satisfaction problems. Artif. Intell. 14 (1980) 263-313
42. Hsiao H.-I., Chen C.-S., and Yu P.S. Parallel execution of hash joins in parallel databases. IEEE Trans. Parallel Distrib. Syst. 8 (1997) 872-883
43. I.F. Ilyas, V. Markl, P. Haas, P. Brown, A. Aboulnaga, CORDS: automatic discovery of correlations and soft functional dependencies, in: Proceedings of ACM SIGMOD, Paris, France, 2004, pp. 647-658.
44. P. Janssen, P. Jégou, R. Nouguier, M.C. Vilarem, A filtering process for general constraint satisfaction problems, in: Proceedings of the IEEE International Workshop on Tools for Artificial Intelligence, Fairfax, VA, 1989, pp. 420-427.
45. Kossmann D. State of the art in distributed query processing. ACM Comp. Surv. 32 (2000) 422-469
46. Kossmann D., and Stocker K. Iterative dynamic programming: a new class of query optimization algorithms. ACM Trans. Database Syst. 25 (2001) 43-82
47. Larrosa J., and Dechter R. Boosting search with variable elimination in constraint optimization and constraint satisfaction problems. Constraints 8 (2003) 303-326
48. Larrosa J., Morancho E., and Niso D. On the practical use of variable elimination in constraint optimization problems: 'Still-life' as a case study. J. Artif. Intell. Res. 23 (2005) 421-440
49. C. Lecoutre, F. Boussemart, F. Hemery, Backjump-based techniques versus conflict directed heuristics, in: Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'04), 2004, pp. 549-557.
50. Z. Li, K.A. Ross, PERF join: an alternative to two-way semijoin and bloomjoin, in: Proceedings of the Fourth International Conference on Information and Knowledge Management, Baltimore, MD, 1995, pp. 137-144.
51. Lynce I., and Marques-Silva J.P. An overview of backtrack search satisfiability algorithms. Ann. Math. Artif. Intell. 37 3 (2003) 307-326
52. Mackworth A.K. Consistency in networks of relations. Artif. Intell. 8 1 (1977) 99-118
53. Maier D. The Theory of Relational Databases (1983), Computer Science Press, Rockville, MD
54. Mamoulis N., and Stergiou K. Solving non-binary CSPs using the hidden variable encoding. In: Walsh T. (Ed). Proceedings of CP 2001. Lecture Notes in Computer Science vol. 2239 (2001), Springer, Berlin 168-182
55. V. Markl, V. Raman, D. Simmen, G. Lohman, H. Pirahesh, M. Cilimdzic, Robust query processing through progressive optimization, in: Proceedings of ACM SIGMOD Conference, Paris, France, 2004, pp. 659-670.
56. McCall J.T., Tront J.G., Gray F.G., Haralick R.M., and McCormack W.M. Parallel computer architectures and problem solving strategies for the consistent labelling problem. IEEE Trans. Comput. C-34 (1985) 973-980
57. McGregor J.J. Relational consistency algorithms and their application in finding subgraph and graph isomorphisms. Inform. Sci. 19 (1979) 229-250
58. Mishra P., and Eich M.H. Join processing in relational databases. ACM Comput. Surv. 24 (1992) 63-113
59. Mitzenmacher M. Compressed Bloom filters. IEEE/ACM Trans. Network. 10 (2002) 604-612
60. Montanari U. Networks of constraints: Fundamental properties and applications to picture processing. Inform. Sci. 7 (1974) 95-132
61. J.M. Morrissey, W.K. Osborn, Y. Liang, Collisions and reduction filters in distributed query processing, in: Proceedings of 2000 Canadian Conference on Electrical and Computer Engineering, Halifax, Nova Scotia, vol. 1, 2000, pp. 240-244.
62. Mullin J.K. Optimal semijoins for distributed database systems. IEEE Trans. Software Eng. 16 (1990) 558-560
63. Nagarajan S., Goodwin S.D., and Sattar A. Extending dual arc consistency. Int. J. Pattern Recogn. Artif. Intell. 17 5 (2003) 781-815
64. N. Narodytska, T. Walsh, Constraint and variable ordering heuristics for compiling configuration problems, in: Proceedings of the 20th International Joint Conference on Artificial Intelligence, Hyderabad, India, 2007, pp. 149-154.
65. Prosser P. An empirical study of phase transitions in binary constraint satisfaction problems. Artif. Intell. 81 (1996) 81-109
66. D. Sabin, E.C. Freuder, Contradicting conventional wisdom in constraint satisfaction, in: A. Borning (Ed.), Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming, PPCP'94, Rosario, Orcas Island, Washington, published as Lecture Notes in Computer Science, vol. 874, 1994, pp. 10-20.
67. Samaras N., and Stergiou K. Binary encodings of non-binary constraint satisfaction problems: algorithms and experimental results. J. Artif. Intell. Res. 24 (2005) 641-684
68. P.G. Selinger, M.M. Astrahan, D.D. Chamberlin, R.A. Lorie, T.G. Price, Access path selection in a relational database management system, in: Proceedings of ACM 1979 SIGMOD Conference, Boston, MA, 1979, pp. 23-34.
69. Shapiro L.D. Join processing in database systems with large main memories. ACM Trans. Database Syst. 11 (1986) 239-264
70. Smith B.M., and Dyer M.E. Locating the phase transition in binary constraint satisfaction problems. Artif. Intell. 81 (1996) 155-181
71. K. Stergiou, T. Walsh, Encodings of non-binary constraint satisfaction problems, in: Proceedings of AAAI'99, 1999, pp. 163-168.
72. S. Subbarayan, R.M. Jensen, T. Hadzic, H.R. Andersen, J. Møller, H. Hulgaard, Comparing two implementations of a complete and backtrack-free interactive configurator, in: Proceedings of the CP-04 Workshop on CSP Techniques with Immediate Application, Toronto, Canada, 2004, pp. 97-111.
73. Tarjan R.E., and Yannakakis M. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput. 13 (1984) 566-579
74. Ullman J.D. Principles of Database and Knowledge-Base systems vol. 1 (1988), Computer Science Press, Rockville, MD
75. Ullmann J.R. Associating parts of patterns. Inform. Control 9 6 (1966) 583-601
76. Ullmann J.R. An algorithm for subgraph isomorphism. JACM 23 1 (1976) 31-42
77. Ullmann J.R. A binary n-gram technique for automatic correction of substitution, deletion, insertion and reversal errors in words. Comput. J. 20 2 (1977) 141-147
78. Ullmann J.R. A relational view of text image processing. In: Haralick R.M., and Simon J.C. (Eds). Issues in Digital Image Processing (1980), Sijthoff and Noordhoff, Alphen aan den Rijn, The Netherlands 139-169
79. Ullmann J.R. Discrete optimization by relational constraint satisfaction. IEEE Trans. Pattern Anal. Mach. Intell. PAMI-4 5 (1982) 544-550
80. Ullmann J.R. Fast implementation of relational operations via inverse projection. Comput. J. 31 2 (1988) 147-154
81. Ullmann J.R., Haralick R.M., and Shapiro L.G. Computer architecture for solving consistent labeling problems. Comput. J. 28 2 (1985) 105-111
82. Van Hentenryck P., Deville Y., and Tang C.-M. A generic arc-consistency algorithm and its specializations. Artif. Intell. 57 (1992) 291-321
83. M.Y. Vardi, Constraint satisfaction and database theory: a tutorial, in: Proceedings of the 19th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Dallas, TX, 2000, pp. 76-85.
84. I. Wegener, Branching programs and binary decision diagrams, SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, PA, 2000.
85. Xu K., and Li W. An average analysis of backtracking on random constraint satisfaction problems. Ann. Math. Artif. Intell. 33 (2001) 21-37
86. Y. Zhang, A.K. Mackworth, Parallel and distributed algorithms for finite constraint satisfaction problems, in: Proceedings of the third IEEE Symposium on parallel distributed computing, Dallas, TX, 1991, pp. 394-397.
87. Y. Zhang, R.Yap, Making AC-3 an optimal algorithm, in: Proceedings of 17th International Joint Conference on Artificial Intelligence, 2001, pp. 316-321.