DBScholar

Back to papers

Determining Relevance of Accesses at Runtime

Summary: Defines runtime notions of immediate and long-term relevance of access methods for answering queries over binding-restricted Web sources, shifting focus from static plans to dynamic decision-making. Characterizes complexity for conjunctive and positive queries and ties relevance to query containment under access limitations, producing new containment complexity results. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1549
Venue
PODS
Year
2011
Pagerank
5.093636e-05
Overall Rank
12,364 | 15.18%
DOI
10.1145/1989284.1989309

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{benedikt_pods11,
        address = {New York, NY, USA},
        series = {{PODS} '11},
        title = {{Determining Relevance of Accesses at Runtime}},
        url = {https://dl.acm.org/doi/10.1145/1989284.1989309},
        doi = {10.1145/1989284.1989309},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Benedikt, Michael and Gottlob, Georg and Senellart, Pierre},
        year = {2011}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
12,351 Querying Schemas With Access Restrictions 2012 VLDB 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 6 of 6 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers