Constraint-based Querying
Constraint-Based Querying is a visual querying method that restricts the search space through formally defined conditions or rules, enabling users to specify constraints on visual or semantic attributes to retrieve relevant data patterns or visualizations.
46
Publications
3.2K
Citations
85
Authors
41
Institutions
Publications per year
2017–2026
1
Parents
46
Exploratory mining and pruning optimizations of constrained associations rules
Raymond T. Ng, Laks V. S. Lakshmanan, Jiawei Han et al. · 1998 · 714 citations
Conjunctive-query containment and constraint satisfaction
Phokion G. Kolaitis, Moshe Y. Vardi · 1998 · 399 citations · Full text
Exploratory mining and pruning optimizations of constrained associations rules
Raymond T. Ng, Laks V. S. Lakshmanan, Jiawei Han et al. · ACM SIGMOD Record · 1998 · 132 citations · Full text
1–5 of 46
85
4
h-index
4
h-index
4
h-index
3
h-index
3
h-index
1–5 of 85
41
Simon Fraser University
Burnaby, Canada
4 h-index
4 publications
895 citations

University of British Columbia
Vancouver, Canada
3 h-index
6 publications
1.8K citations
University of California, Santa Barbara
Santa Barbara, United States
3 h-index
3 publications
126 citations
Stanford University
Stanford, United States
3 h-index
5 publications
258 citations
University of California, Los Angeles
Los Angeles, United States
2 h-index
3 publications
131 citations

Concordia University
Montreal, Canada
2 h-index
2 publications
846 citations
Nokia (United States)
Coppell, United States
2 h-index
4 publications
116 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
2 h-index
2 publications
100 citations
1–8 of 41
5 publications · 401 citations
5
h-index
Conference · 2 publications · 68 citations
2
h-index
2 publications · 70 citations
2
h-index
TKDE · 2 publications · 37 citations
2
h-index
2 publications · 258 citations
2
h-index
1–5