Pilot corpus: NIH-funded biomedical datasets. Any DOI can be scored on demand — network effects sharpen as coverage grows.

Any-k Algorithms for Enumerating Ranked Answers to Conjunctive Queries

ACM Transactions on Database Systems(2025)10.1145/3734517Source: DataRank Database

Any-k Algorithms for Enumerating Ranked Answers to Conjunctive Queries is a research paper published in ACM Transactions on Database Systems (2025). On theSindex it has a DataRank of 0.

N/A

0DataRank · unranked

Scored on demand from live citation data

Open Access0 citations

Free full text

Cite:

DataRank reads this dataset's downstream impact straight off the citation graph — no black box, no proprietary weighting. How is this computed?

›Methodology & internals

datarank_citation_only_1hop_v6· scope data_onlyMethodology

Pipeline:MetadataData-paper checkEnrichmentCitation networkScoring

Enrichment:Funding (6 grants)Impact (FWCI 0.00)OA: hybridTopics (23)IDs (PubMed, OpenAlex)

FAIR Checklist

Context only (not used in score)

Findable (1/2)

Has DOI

Accessible (1/2)

Open Access

Interoperable (0/2)

Reusable (0/3)

FAIR checklist signals are shown for context only and do not affect DataRank scoring.

Run a calibrated FAIR evaluation for this paper →

We only score data papers we can read in full — never from an abstract alone.

Authors (3)

Wolfgang Gatterbauer ORCID,Mirek Riedewald ORCID,Nikolaos Tziavelis ORCID

Live enrichment

PubMed:21097893 OpenAlex:https://openalex.org/W4411652453

the Office of Naval Research

Grant: N00014-21-C-1111

National Institutes of Health

Grant: R01 NS091421

National Science Foundation

Grant: IS-1762268 and IIS-1956096

National Institutes of Health

Grant: 5R01NS091421-03

Software for Automated Reconstruction of Structure & Dynamics of Neural Circuits

National Science Foundation

Grant: 1956096

III: Medium: Table-as-Query: Unifying Data Discovery and Alignment

National Science Foundation

Grant: 1762268

CAREER: Scaling Approximate Inference and Approximation-Aware Learning

FWCI

0.00

Citation Percentile

0.2%

hybridLicense: cc-by

journalhttps://doi.org/10.1145/3734517

publisherhttps://doi.org/10.1145/3734517

publisherhttps://dl.acm.org/doi/pdf/10.1145/3734517

https://dx.doi.org/10.48550/arxiv.2205.05649

http://arxiv.org/abs/2205.05649

Fields of Study

Data Management and AlgorithmsAdvanced Database Systems and QueriesOptimization and Search Problems0202 electrical engineering, electronic engineering, information engineering02 engineering and technology

Keywords

Computer scienceConjunctive queryDatabase queryBoolean conjunctive queryAlgorithmInformation retrievalData miningSearch engineRelational databaseWeb search querySargableFOS: Computer and information sciencesComputer Science - Logic in Computer ScienceComputer Science - DatabasesComputer Science - Data Structures and AlgorithmsDatabases (cs.DB)Data Structures and Algorithms (cs.DS)Logic in Computer Science (cs.LO)