VLDB 1998 - PDF Preprint Papers

VLDB 1998 International Conference on Very Large Data Bases

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed VLDB-1998 Paper

click to vote

VLDB
1998
ACM

312views Database» more VLDB 1998»

WaveCluster: A Multi-Resolution Clustering Approach for Very Large Spatial Databases

14 years 4 months ago

Download www.vldb.org

Many applications require the management of spatial data. Clustering large spatial databases is an important problem which tries to find the densely populated regions in the featu...

Gholamhosein Sheikholeslami, Surojit Chatterjee, A...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	312	WaveCluster: A Multi-Resolution Clustering Approach for Very Large Spatial Databases	claim
2	204	Clustering Categorical Data: An Approach Based on Dynamical Systems	claim
3	199	The ADABAS Buffer Pool Manager	claim
4	192	Algorithms for Mining Distance-Based Outliers in Large Datasets	claim
5	180	nD-SQL: A Multi-Dimensional Language for Interoperability and OLAP	claim
6	180	Active Storage for Large-Scale Data Mining and Multimedia	claim
7	173	Fast Image Retrieval Using Color-Spatial Information	claim
8	170	Advanced Data Processing in KRISYS: Modeling Concepts, Implementation Techniques, and Client/Server Issues	claim
9	153	Small Materialized Aggregates: A Light Weight Index Structure for Data Warehousing	claim
10	149	Incremental Maintenance for Materialized Views over Semistructured Data	claim
11	147	Architecture of Oracle Parallel Server	claim
12	147	Scalable Techniques for Mining Causal Structures	claim
13	144	Proximity Search in Databases	claim
14	142	On the Discovery of Interesting Patterns in Association Rules	claim
15	141	Bulk-Loading Techniques for Object Databases and an Application to Relational Data	claim
16	139	Experiences in Federated Databases: From IRO-DB to MIRO-Web	claim
17	138	TOPAZ: a Cost-Based, Rule-Driven, Multi-Phase Parallelizer	claim
18	136	Materialized View Selection for Multidimensional Datasets	claim
19	134	Secure Buffering in Firm Real-Time Database Systems	claim
20	134	Design, Implementation, and Performance of the LHAM Log-Structured History Data Access Method	claim
21	132	Buffering and Read-Ahead Strategies for External Mergesort	claim
22	131	An Asynchronous Avoidance-Based Cache Consistency Algorithm for Client Caching DBMSs	claim
23	127	Algorithms for Mining Association Rules for Binary Segmentations of Huge Categorical Databases	claim
24	126	Materialized Views in Oracle	claim
25	123	Diag-Join: An Opportunistic Join Algorithm for 1:N Relationships	claim
26	122	Atomicity versus Anonymity: Distributed Transactions for Electronic Commerce	claim
27	121	Hash Joins and Hash Teams in Microsoft SQL Server	claim
28	120	KODA - The Architecture And Interface of a Data Model Independent Kernel	claim
29	120	Algorithms for Querying by Spatial Structure	claim
30	120	PUBLIC: A Decision Tree Classifier that Integrates Building and Pruning	claim
31	117	DTL's DataSpot: Database Exploration Using Plain Language	claim
32	116	The Heterogeneity Problem and Middleware Technology: Experiences with and Performance of Database Gateways	claim
33	115	Bank of America Case Study: The Information Currency Advantage	claim
34	112	Incremental Clustering for Mining in a Data Warehousing Environment	claim
35	112	A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces	claim
36	111	Expiring Data in a Warehouse	claim
37	111	Filtering with Approximate Predicates	claim
38	110	Massive Stochastic Testing of SQL	claim
39	108	Binding Propagation in Disjunctive Databases	claim
40	108	MindReader: Querying Databases Through Multiple Examples	claim
41	105	Computing Iceberg Queries Efficiently	claim
42	104	Evaluating Functional Joins Along Nested Reference Sets in Object-Relational and Object-Oriented Databases	claim
43	103	The Drill Down Benchmark	claim
44	102	A Database System for Real-Time Event Aggregation in Telecommunication	claim
45	102	Using Schema Matching to Simplify Heterogeneous Data Translation	claim
46	101	On Optimal Node Splitting for R-trees	claim
47	100	Mining Surprising Patterns Using Temporal Description Length	claim
48	97	Design and Analysis of Parametric Query Optimization Algorithms	claim
49	96	Checkpointing in Oracle	claim
50	95	RainForest - A Framework for Fast Decision Tree Construction of Large Datasets	claim
51	95	The National Medical Knowledge Bank	claim
52	95	From Data Independence to Knowledge Independence: An on-going Story	claim
53	94	Issues in Developing Very Large Data Warehouses	claim
54	92	Optimal Histograms with Quality Guarantees	claim
55	91	Determining Text Databases to Search in the Internet	claim
56	91	The Cubetree Storage Organization	claim
57	87	R-Tree Based Indexing of Now-Relative Bitemporal Data	claim
58	87	Fast High-Dimensional Data Search in Incomplete Databases	claim
59	86	Scalable Sweeping-Based Spatial Join	claim
60	86	Inferring Function Semantics to Optimize Queries	claim
61	84	Performance Measurements of Tertiary Storage Devices	claim
62	82	Reducing the Braking Distance of an SQL Query Engine	claim
63	82	Resource Scheduling for Composite Multimedia Objects	claim
64	79	Low-Cost Compensation-Based Query Processing	claim
65	77	Heterogeneous Database Query Optimization in DB2 Universal DataJoiner	claim
66	77	Safely and Efficiently Updating References During On-line Reorganization	claim
67	76	Querying Continuous Time Sequences	claim
68	75	Ratio Rules: A New Paradigm for Fast, Quantifiable Data Mining	claim
69	73	Improving Adaptable Similarity Query Processing by Using Approximations	claim
70	73	Selectivity Estimation in Extensible Databases - A Neural Network Approach	claim
71	70	Plan-Per-Tuple Optimization Solution - Parallel Execution of Expensive User-Defined Functions	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers