On the public citation graph

Analysis of pre-computed partition top method for range top-k queries in OLAP data cubes

0 signed · 20 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.1007/3-540-44469-6_44openalex-snapshot
Range-Max/Min Query in OLAP Data Cube
inferredcites →https://doi.org/10.1007/3-540-44759-8_66openalex-snapshot
Range Top/Bottom k Queries in OLAP Sparse Data Cubes
inferredcites →https://doi.org/10.1007/3-540-46146-9_64openalex-snapshot
Adaptive Method for Range Top-k Queries in OLAP Data Cubes
inferredcites →https://doi.org/10.1016/s0020-0255(98)10035-xopenalex-snapshot
An efficient processing of range-MIN/MAX queries over data cube
inferredcites →https://doi.org/10.1016/s0169-023x(00)00007-0openalex-snapshot
Range queries in dynamic OLAP data cubes
inferredcites →https://doi.org/10.1023/a:1009726021843openalex-snapshot
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals
inferredcites →https://doi.org/10.1109/codas.2001.945152openalex-snapshot
Range sum queries in dynamic OLAP data cubes
inferredcites →https://doi.org/10.1109/icde.1997.581777openalex-snapshot
Modeling multidimensional databases
inferredcites →https://doi.org/10.1109/icde.1999.754948openalex-snapshot
Relative prefix sums: an efficient approach for querying dynamic OLAP data cubes
inferredcites →https://doi.org/10.1145/253260.253274openalex-snapshot
Range queries in OLAP data cubes

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11535331_14openalex-snapshot
Evaluation of Top-k OLAP Queries Using Aggregate R–Trees
inferred← citeshttps://doi.org/10.1007/3-540-44759-8_66openalex-snapshot
Range Top/Bottom k Queries in OLAP Sparse Data Cubes
inferred← citeshttps://doi.org/10.1007/978-3-642-01344-7_5openalex-snapshot
Web 2.0 OLAP: From Data Cubes to Tag Clouds
inferred← citeshttps://doi.org/10.1016/j.datak.2008.04.001openalex-snapshot
Extracting k most important groups from data efficiently
inferred← citeshttps://doi.org/10.1109/dbis.2006.1678479openalex-snapshot
An efficient algorithm to rank the partial-sum queries results
inferred← citeshttps://doi.org/10.1145/1451940.1451958openalex-snapshot
Pruning attribute values from data cubes with diamond dicing
inferred← citeshttps://doi.org/10.48550/arxiv.0710.2156openalex-snapshot
Collaborative OLAP with Tag Clouds: Web 2.0 OLAP Formalism and Experimental Evaluation
inferred← citeshttps://doi.org/10.48550/arxiv.0805.0747openalex-snapshot
Pruning Attribute Values From Data Cubes with Diamond Dicing
inferred← citeshttps://doi.org/10.5120/18859-0474openalex-snapshot
An Effective Method to Answer OLAP Queries using R*-trees in Distributed Environment
inferred← citeshttps://doi.org/10.5220/0001515800050012openalex-snapshot
COLLABORATIVE OLAP WITH TAG CLOUDS - Web 2.0 OLAP Formalism and Experimental Evaluation
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.