Database Paper Browser

Back to papers

Finding a Minimal Tree Pattern Under Neighborhood Constraints

Summary: Find minimal tree patterns conforming to schemas mapping each label to allowed neighbor bags; NP-hard but FPT parameterized by label-set size. Treats two schema languages: pairwise mutual exclusions (W[1]-hard, FPT for circular-arc graphs) and regular-expression schemas (FPT). (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1556
Venue
PODS
Year
2011
Pagerank
4.3415167e-05
Overall Rank
9,441 | 34.33%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
4,838 Finding Patterns in a Knowledge Base using Keywords to Compose Table Answers 2014 VLDB 5.8887949e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
54 DISCOVER: Keyword Search in Relational Databases 2002 VLDB 0.00066047203
548 Schema-Free XQuery 2004 VLDB 0.00020391259
1,073 Finding and Approximating Top-k Answers in Keyword Proximity Search 2006 PODS 0.00014264992
1,453 Keyword Proximity Search in Complex Data Graphs 2008 SIGMOD 0.00011917976
1,564 Keyword Search in Databases: The Power of RDBMS 2009 SIGMOD 0.00011350495
3,110 Learning to Create Data-Integrating Queries 2008 VLDB 7.5475982e-05
9,359 IQ: The Case for Iterative Querying for Knowledge 2011 CIDR 4.3509599e-05
12,239 Exploratory Keyword Search on Data Graphs 2010 SIGMOD 4.1945683e-05
12,318 ExQueX: Exploring and Querying XML Documents 2009 SIGMOD 4.1945683e-05
Previous Page 1 / 1 Next

Semantically Similar Papers