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.0006567919 |
| 31 | BIRCH: An Efficient Data Clustering Method for Very Large Databases | 1996 | SIGMOD | 0.00050347119 |
| 88 | Efficient and Effective Clustering Methods for Spatial Data Mining | 1994 | VLDB | 0.00035240327 |
| 304 | Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications | 1998 | SIGMOD | 0.00021917388 |
| 351 | CURE: An Efficient Clustering Algorithm for Large Databases | 1998 | SIGMOD | 0.00020424271 |
| 483 | FastMap: A Fast Algorithm for Indexing, Data-Mining and Visualization of Traditional and Multimedia Datasets | 1995 | SIGMOD | 0.00017756569 |
| 610 | Efficiently Supporting Ad Hoc Queries in Large Datasets of Time Sequences | 1997 | SIGMOD | 0.00015783259 |
| 704 | Dynamic Itemset Counting and Implication Rules for Market Basket Data | 1997 | SIGMOD | 0.00014837704 |
| 6,882 | Rearranging Data to Maximize the Efficiency of Compression | 1986 | PODS | 5.7469443e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,084 | Comprehensive and Efficient Workload Compression | 2021 | VLDB |
| 2 | 8,557 | A Condensed Representation to Find Frequent Patterns | 2001 | PODS |
| 3 | 3,949 | A New Compression Method with Fast Searching on Large Databases | 1987 | VLDB |
| 4 | 921 | Query Optimization In Compressed Database Systems | 2001 | SIGMOD |
| 5 | 9,673 | High-Ratio Compression for Machine-Generated Data | 2023 | SIGMOD |
| 6 | 9,795 | Fingerprints for Compressed Columnar Data Search | 2019 | SIGMOD |
| 7 | 8,728 | Computing A Well-Representative Summary of Conjunctive Query Results | 2024 | PODS |
| 8 | 7,942 | Efficient and Tunable Similar Set Retrieval | 2001 | SIGMOD |
| 9 | 5,383 | Compressed Representations of Conjunctive Query Results | 2018 | PODS |
| 10 | 3,324 | Mining Compressed Frequent-Pattern Sets | 2005 | VLDB |