Semantic Compression and Pattern Extraction with Fascicles

Summary: Introduces fascicles F(k,t): rows with k compact attributes whose values lie within t, enabling semantic compression. Focuses on problems: storage minimization with fascicles and pattern extraction under min support; NP-hardness and heuristics. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 8560
Venue: VLDB
Year: 1999
Pagerank: 0.00011203327
Overall Rank: 1,599 | 88.89%
DOI: -

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 11 of 11 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
387	Graph Summarization with Bounded Error	2008	SIGMOD	0.00024682268
430	Approximate Query Processing: Taming the TeraBytes! A Tutorial	2001	VLDB	0.00023406426
733	Discovering Data Quality Rules	2008	VLDB	0.00017428132
2,906	SPARTAN: A Model-Based Semantic Compression System for Massive Data Tables	2001	SIGMOD	7.9324961e-05
3,419	LeCo: Lightweight Compression via Learning Serial Correlations	2024	SIGMOD	7.1127752e-05
3,539	General purpose database summarization	2005	VLDB	6.9925094e-05
3,741	DeepSqueeze: Deep Semantic Compression for Tabular Data	2020	SIGMOD	6.7952067e-05
4,608	Interactive Summarization and Exploration of Top Aggregate Query Answers	2018	VLDB	6.046643e-05
4,818	Clustering by Pattern Similarity in Large Data Sets	2002	SIGMOD	5.8955574e-05
5,061	Hierarchical Subspace Sampling: A Unified Framework for High Dimensional Data Reduction, Selectivity Estimation and Nearest Neighbor Search	2002	SIGMOD	5.717245e-05
9,595	High-Ratio Compression for Machine-Generated Data	2023	SIGMOD	4.3153078e-05

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.0010863639
27	Efficient and Effective Clustering Methods for Spatial Data Mining	1994	VLDB	0.00080846213
33	BIRCH: An Efficient Data Clustering Method for Very Large Databases	1996	SIGMOD	0.00077399244
277	Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications	1998	SIGMOD	0.00029356968
340	CURE: An Efficient Clustering Algorithm for Large Databases	1998	SIGMOD	0.00026854084
471	FastMap: A Fast Algorithm for Indexing, Data-Mining and Visualization of Traditional and Multimedia Datasets	1995	SIGMOD	0.00022348285
651	Dynamic Itemset Counting and Implication Rules for Market Basket Data	1997	SIGMOD	0.00018649942
689	Efficiently Supporting Ad Hoc Queries in Large Datasets of Time Sequences	1997	SIGMOD	0.00018069077
6,340	Rearranging Data to Maximize the Efficiency of Compression	1986	PODS	5.0985531e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
3,541	Similarity search in the blink of an eye with compressed indices	2023	VLDB	6.9910982e-05
4,469	Comprehensive and Efficient Workload Compression	2021	VLDB	6.1535623e-05
8,315	A Condensed Representation to Find Frequent Patterns	2001	PODS	4.5392079e-05
3,501	A New Compression Method with Fast Searching on Large Databases	1987	VLDB	7.033534e-05
1,098	Query Optimization In Compressed Database Systems	2001	SIGMOD	0.00014070252
9,595	High-Ratio Compression for Machine-Generated Data	2023	SIGMOD	4.3153078e-05
9,665	Fingerprints for Compressed Columnar Data Search	2019	SIGMOD	4.3041238e-05
8,521	Computing A Well-Representative Summary of Conjunctive Query Results	2024	PODS	4.4893996e-05
7,521	Efficient and Tunable Similar Set Retrieval	2001	SIGMOD	4.7135369e-05
3,061	Mining Compressed Frequent-Pattern Sets	2005	VLDB	7.6389596e-05