Efficient Ad-Hoc Graph Inference and Matching in Biological Databases

Summary: Formalizes ad-hoc online inference and subgraph matching of gene regulatory networks from feature databases without full materialization, via probabilistic graphs. Introduces a probabilistic edge-score and, with reduction, pruning, embedding, and index-guided query processing, to efficiently answer IM-GRN queries. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 5357
Venue: SIGMOD
Year: 2017
Pagerank: 5.093636e-05
Overall Rank: 11,974 | 17.85%
DOI: 10.1145/3035918.3035929

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

1. Xiang Lian (Kent State University)
2. Dongchul Kim (University of Texas)

BibTeX Citation

@inproceedings{lian_sigmod17,
        title = {{Efficient Ad-Hoc Graph Inference and Matching in Biological Databases}},
        author = {Lian, Xiang and Kim, Dongchul},
        series = {{SIGMOD} '17},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3035918.3035929},
        url = {https://dl.acm.org/doi/10.1145/3035918.3035929},
        year = {2017}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
4	The R*-tree: An Efficient and Robust Access Method for Points and Rectangles	1990	SIGMOD	0.001157935
85	The X-tree: An Index Structure for High-Dimensional Data	1996	VLDB	0.00035405879
238	MCDB: A Monte Carlo Approach to Managing Uncertain Data	2008	SIGMOD	0.0002369322
277	The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries	1997	SIGMOD	0.00022537944
296	A Data-Based Approach to Social Influence Maximization	2012	VLDB	0.00022220351
1,049	k-Nearest Neighbors in Uncertain Graphs	2010	VLDB	0.00012415522
8,935	Efficient Query Answering in Probabilistic RDF Graphs	2011	SIGMOD	5.3483178e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	3,423	Computing Graph Edit Distance via Neural Graph Matching	2023	VLDB
2	8,935	Efficient Query Answering in Probabilistic RDF Graphs	2011	SIGMOD
3	11,762	Simulation-based Approximate Graph Pattern Matching	2020	SIGMOD
4	6,520	Mining and Indexing Graphs for Supergraph Search	2013	VLDB
5	1,049	k-Nearest Neighbors in Uncertain Graphs	2010	VLDB
6	11,756	Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees	2020	SIGMOD
7	4,853	Efficient Subgraph Search over Large Uncertain Graphs	2011	VLDB
8	591	Substructure Similarity Search in Graph Databases	2005	SIGMOD
9	6,149	Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding	2024	VLDB
10	3,548	Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases	2012	VLDB