On the public citation graph

Automatic Database Clustering Using Data Mining

0 signed · 21 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/s0020-0190(00)00142-3openalex-snapshot
A clustering algorithm based on graph connectivity
inferredcites →https://doi.org/10.1016/s0306-4379(99)00003-4openalex-snapshot
Efficient mining of association rules using closed itemset lattices
inferredcites →https://doi.org/10.1109/32.238583openalex-snapshot
A transaction-based approach to vertical partitioning for relational database systems
inferredcites →https://doi.org/10.1109/tkde.2005.60openalex-snapshot
Efficient algorithms for mining closed itemsets and their lattice structure
inferredcites →https://doi.org/10.1137/1.9781611972726.27openalex-snapshot
CHARM: An Efficient Algorithm for Closed Itemset Mining
inferredcites →https://doi.org/10.1145/1007568.1007609openalex-snapshot
Integrating vertical and horizontal partitioning into automated physical database design
inferredcites →https://doi.org/10.1145/1994.2209openalex-snapshot
Vertical partitioning algorithms for database design
inferredcites →https://doi.org/10.1145/276304.276337openalex-snapshot
AutoAdmin “what-if” index analysis utility
inferredcites →https://doi.org/10.1145/306101.306137openalex-snapshot
The Asilomar report on database research
inferredcites →https://doi.org/10.1287/opre.20.5.993openalex-snapshot
Problem Decomposition and Data Reorganization by a Clustering Technique

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-642-23091-2_48openalex-snapshot
A Vertical Partitioning Algorithm for Distributed Multimedia Databases
inferred← citeshttps://doi.org/10.1007/978-3-642-25330-0_24openalex-snapshot
An Active System for Dynamic Vertical Partitioning of Relational Databases
inferred← citeshttps://doi.org/10.1007/978-3-642-32597-7_17openalex-snapshot
Dynamic Vertical Partitioning of Multimedia Databases Using Active Rules
inferred← citeshttps://doi.org/10.1007/s10844-016-0420-9openalex-snapshot
Active rule base development for dynamic vertical partitioning of multimedia databases
inferred← citeshttps://doi.org/10.1016/j.eswa.2015.10.006openalex-snapshot
Combination of genetic network programming and knapsack problem to support record clustering on distributed databases
inferred← citeshttps://doi.org/10.1109/clustr.2008.4663800openalex-snapshot
Using cluster computing to support automatic and dynamic database clustering
inferred← citeshttps://doi.org/10.1109/icces.2009.5383064openalex-snapshot
Data mining in multi-feature sensor networks
inferred← citeshttps://doi.org/10.1109/icnsc.2013.6548782openalex-snapshot
DYVEP: An active database system with vertical partitioning functionality
inferred← citeshttps://doi.org/10.1145/2351476.2351485openalex-snapshot
DYMOND
inferred← citeshttps://doi.org/10.2991/jrnal.2015.2.2.2openalex-snapshot
On-line Rule Updating System Using Evolutionary Computation for Managing Distributed Database
inferred← citeshttps://doi.org/10.9790/0661-0330811openalex-snapshot
Energy Efficient Data Mining in Multi-Feature Sensor Networks Using Improved Leach Communication Protocol
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.