Semantic Compression and Pattern Extraction with Fascicles
Summary: Introduces fascicles—record subsets with k attributes whose numeric ranges or categorical cardinalities are bounded by t—as a unified basis for semantic compression and pattern mining. Algorithms address minimum-storage representation and maximal-quality extraction under support constraints despite intractability. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. H. V. Jagadish (University of Michigan)
- 2. Jason Madar (University of British Columbia)
- 3. Raymond T. Ng (University of British Columbia)
BibTeX Citation
@article{jagadish_vldb99,
title = {{Semantic Compression and Pattern Extraction with Fascicles}},
author = {Jagadish, H. V. and Madar, Jason and Ng, Raymond T.},
journal = {PVLDB},
series = {{VLDB} '99},
pages = {186--197},
year = {1999}
}
Incoming Citations (Sorted by Pagerank)
Showing 11 of 11 citing papers.
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 |
|---|---|---|---|---|
| 13 | Mining Association Rules between Sets of Items in Large Databases | 1993 | SIGMOD | 0.00064391979 |
| 32 | BIRCH: An Efficient Data Clustering Method for Very Large Databases | 1996 | SIGMOD | 0.00049714561 |
| 94 | Efficient and Effective Clustering Methods for Spatial Data Mining | 1994 | VLDB | 0.0003456395 |
| 308 | Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications | 1998 | SIGMOD | 0.00021463972 |
| 364 | CURE: An Efficient Clustering Algorithm for Large Databases | 1998 | SIGMOD | 0.00019978187 |
| 488 | FastMap: A Fast Algorithm for Indexing, Data-Mining and Visualization of Traditional and Multimedia Datasets | 1995 | SIGMOD | 0.00017451091 |
| 622 | Efficiently Supporting Ad Hoc Queries in Large Datasets of Time Sequences | 1997 | SIGMOD | 0.00015485529 |
| 722 | Dynamic Itemset Counting and Implication Rules for Market Basket Data | 1997 | SIGMOD | 0.0001451406 |
| 7,025 | Rearranging Data to Maximize the Efficiency of Compression | 1986 | PODS | 5.6159502e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,809 | Comprehensive and Efficient Workload Compression | 2021 | VLDB |
| 2 | 4,015 | A New Compression Method with Fast Searching on Large Databases | 1987 | VLDB |
| 3 | 8,732 | A Condensed Representation to Find Frequent Patterns | 2001 | PODS |
| 4 | 898 | Query Optimization In Compressed Database Systems | 2001 | SIGMOD |
| 5 | 9,850 | High-Ratio Compression for Machine-Generated Data | 2023 | SIGMOD |
| 6 | 9,984 | Fingerprints for Compressed Columnar Data Search | 2019 | SIGMOD |
| 7 | 7,518 | Computing A Well-Representative Summary of Conjunctive Query Results | 2024 | PODS |
| 8 | 8,117 | Efficient and Tunable Similar Set Retrieval | 2001 | SIGMOD |
| 9 | 5,492 | Compressed Representations of Conjunctive Query Results | 2018 | PODS |
| 10 | 3,384 | Mining Compressed Frequent-Pattern Sets | 2005 | VLDB |