DBScholar

Back to papers

Concise Descriptions of Subsets of Structured Sets

Summary: Formulate L‑MDL: find the shortest expression in a language L that defines a subset of a structured set modeled by a set cover, capturing hierarchies (XML) and multidimensional/OLAP schemas. Provide complexity results, an efficient hierarchical algorithm, and applications to result summarization and ROLAP/XML query optimization. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1284
Venue
PODS
Year
2003
Pagerank
5.4353444e-05
Overall Rank
8,393 | 42.42%
DOI
10.1145/773153.773166

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{mendelzon_pods03,
        address = {New York, NY, USA},
        series = {{PODS} '03},
        title = {{Concise Descriptions of Subsets of Structured Sets}},
        url = {https://dl.acm.org/doi/10.1145/773153.773166},
        doi = {10.1145/773153.773166},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Mendelzon, Alberto O. and Pu, Ken Q.},
        year = {2003}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
4,204 MDL Summarization with Holes 2005 VLDB 6.834169e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 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