On the public citation graph

Index compression through document reordering

0 signed · 113 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/s0169-7552(97)00031-7openalex-snapshot
Syntactic clustering of the Web
inferredcites →https://doi.org/10.1109/dcc.1994.305919openalex-snapshot
Markov models for clusters in concordance compression
inferredcites →https://doi.org/10.1109/dcc.1995.515572openalex-snapshot
Modeling word occurrences for the compression of concordances
inferredcites →https://doi.org/10.1109/dcc.1996.488313openalex-snapshot
Exploiting clustering in inverted file compression
inferredcites →https://doi.org/10.1109/dcc.2001.917151openalex-snapshot
Towards compressing Web graphs
inferredcites →https://doi.org/10.1109/tit.1966.1053907openalex-snapshot
Run-length encodings (Corresp.)
inferredcites →https://doi.org/10.1137/s1064827595287997openalex-snapshot
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
inferredcites →https://doi.org/10.1145/301250.301367openalex-snapshot
Subquadratic approximation algorithms for clustering problems in high dimensional spaces

What points at this work

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

inferred← citeshttps://doi.org/10.1000/604faketemporaryforimportopenalex-snapshot
PISA: Performant indexes and search for academia
inferred← citeshttps://doi.org/10.1007/11556985_34openalex-snapshot
A Software Architecture for Effective Document Identifier Reassignment
inferred← citeshttps://doi.org/10.1007/11880592_9openalex-snapshot
Efficient Query Evaluation Through Access-Reordering
inferred← citeshttps://doi.org/10.1007/978-0-387-73137-7_6openalex-snapshot
Inverted Lists Compression Using Contextual Information
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_628openalex-snapshot
Intersections of Inverted Lists
inferred← citeshttps://doi.org/10.1007/978-3-030-15712-8_22openalex-snapshot
Compressing Inverted Indexes with Recursive Graph Bisection: A Reproducibility Study
inferred← citeshttps://doi.org/10.1007/978-3-030-15712-8_23openalex-snapshot
An Experimental Study of Index Compression and DAAT Query Processing Methods
inferred← citeshttps://doi.org/10.1007/978-3-031-02298-2openalex-snapshot
Scalability Challenges in Web Search Engines
inferred← citeshttps://doi.org/10.1007/978-3-031-28241-6_6openalex-snapshot
Index-Based Batch Query Processing Revisited
inferred← citeshttps://doi.org/10.1007/978-3-319-08001-7_12openalex-snapshot
Reordering Buffer Management with Advice
inferred← citeshttps://doi.org/10.1007/978-3-319-11749-2_18openalex-snapshot
Common Neighbor Query-Friendly Triangulation-Based Large-Scale Graph Compression
inferred← citeshttps://doi.org/10.1007/978-3-319-63962-8_52-2openalex-snapshot
Inverted Index Compression
inferred← citeshttps://doi.org/10.1007/978-3-540-31865-1_27openalex-snapshot
Document Identifier Reassignment Through Dimensionality Reduction
inferred← citeshttps://doi.org/10.1007/978-3-540-45227-0_46openalex-snapshot
g-binary: A New Non-parameterized Code for Improved Inverted File Compression
inferred← citeshttps://doi.org/10.1007/978-3-540-71496-5_12openalex-snapshot
Sorting Out the Document Identifier Assignment Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-95995-3_10openalex-snapshot
Permuting Web Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-04409-0_50openalex-snapshot
Entry Pairing in Inverted File
inferred← citeshttps://doi.org/10.1007/978-3-642-17514-5_27openalex-snapshot
Alphabet Partitioning for Compressed Rank/Select and Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_628-1openalex-snapshot
Intersections of Inverted Lists
inferred← citeshttps://doi.org/10.1007/978-3-642-33090-2_15openalex-snapshot
A Bicriteria Approximation for the Reordering Buffer Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-35341-3_20openalex-snapshot
Yet Another Sorting-Based Solution to the Reassignment of Document Identifiers
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_39openalex-snapshot
Online Stochastic Reordering Buffer Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_60openalex-snapshot
Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_7openalex-snapshot
On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs
inferred← citeshttps://doi.org/10.1007/s10791-006-6614-yopenalex-snapshot
TSP and cluster-based solutions to the reassignment of document identifiers
inferred← citeshttps://doi.org/10.1007/s10791-012-9213-0openalex-snapshot
Using rating matrix compression techniques to speed up collaborative recommendations
inferred← citeshttps://doi.org/10.1007/s10951-016-0487-8openalex-snapshot
Reordering buffer management with advice
inferred← citeshttps://doi.org/10.1016/j.ic.2019.104466openalex-snapshot
Comparison between text compression algorithms in biological sequences
inferred← citeshttps://doi.org/10.1016/j.ipm.2018.05.007openalex-snapshot
Hybrid compression of inverted lists for reordered document collections
inferred← citeshttps://doi.org/10.1016/j.procs.2013.05.175openalex-snapshot
Distributing Efficiently the Block-Max WAND Algorithm
inferred← citeshttps://doi.org/10.1023/b:inrt.0000048490.99518.5copenalex-snapshot
Inverted Index Compression Using Word-Aligned Binary Codes
inferred← citeshttps://doi.org/10.1080/15427951.2009.10390641openalex-snapshot
Permuting Web and Social Graphs
inferred← citeshttps://doi.org/10.1109/bigdata47090.2019.9006023openalex-snapshot
Forward Index Compression for Instance Retrieval in an Augmented Reality Application
inferred← citeshttps://doi.org/10.1109/cisim.2010.5643662openalex-snapshot
XML compression improvements based on the clustering of elements
inferred← citeshttps://doi.org/10.1109/cmpsac.2004.1342676openalex-snapshot
Compressing an inverted file with LCS
inferred← citeshttps://doi.org/10.1109/dcc.2010.53openalex-snapshot
Inverted Index Compression for Scalable Image Matching
inferred← citeshttps://doi.org/10.1109/dcc.2015.15openalex-snapshot
Compressing Yahoo Mail
inferred← citeshttps://doi.org/10.1109/focs.2019.00012openalex-snapshot
Polylogarithmic Guarantees for Generalized Reordering Buffer Management
inferred← citeshttps://doi.org/10.1109/hotweb.2006.355272openalex-snapshot
A Mixed Coding Scheme for Inverted File Index Compression
inferred← citeshttps://doi.org/10.1109/icde.2018.00043openalex-snapshot
RStore: A Distributed Multi-Version Document Store
inferred← citeshttps://doi.org/10.1109/icdim.2007.369220openalex-snapshot
Compressing Inverted File Index Using Mixed Delta/Flat Binary Code
inferred← citeshttps://doi.org/10.1109/icdm.2013.63openalex-snapshot
Efficient Visualization of Large-Scale Data Tables through Reordering and Entropy Minimization
inferred← citeshttps://doi.org/10.1109/infcom.2003.1209237openalex-snapshot
Efficient content location using interest-based locality in peer-to-peer systems
inferred← citeshttps://doi.org/10.1109/iscis.2009.5291835openalex-snapshot
Efficient k-word proximity search
inferred← citeshttps://doi.org/10.1109/pdgc.2010.5679966openalex-snapshot
A framework for hierarchical clustering based indexing in search engines
inferred← citeshttps://doi.org/10.1109/synchroinfo49631.2020.9166107openalex-snapshot
Increase the Speed of Search Index in the Duplicate Text Detection Systems
inferred← citeshttps://doi.org/10.1109/tkde.2022.3208902openalex-snapshot
Tradeoff Options for Bipartite Graph Partitioning
inferred← citeshttps://doi.org/10.1109/ubmk50275.2020.9219484openalex-snapshot
Efficient Finite-State Decoding of Rice Codes for Large Alphabets
inferred← citeshttps://doi.org/10.1109/wi-iatw.2007.109openalex-snapshot
Document Classification Based on the Topic Evaluation and Its Usage in Data Compression
inferred← citeshttps://doi.org/10.1109/wi.2006.96openalex-snapshot
Improving Index Compression Using Cluster Information
inferred← citeshttps://doi.org/10.1137/1.9781611973105.70openalex-snapshot
A Constant Factor Approximation Algorithm for Reordering Buffer Management
inferred← citeshttps://doi.org/10.1137/1.9781611974782.79openalex-snapshot
Reordering Buffers with Logarithmic Diameter Dependency for Trees
inferred← citeshttps://doi.org/10.1145/1008992.1009046openalex-snapshot
Assigning identifiers to documents to enhance the clustering property of fulltext indexes
inferred← citeshttps://doi.org/10.1145/1076034.1076141openalex-snapshot
Characterization of a simple case of the reassignment of document identifiers as a pattern sequencing problem
inferred← citeshttps://doi.org/10.1145/1132956.1132959openalex-snapshot
Inverted files for text search engines
inferred← citeshttps://doi.org/10.1145/1183401.1183444openalex-snapshot
Accelerating sparse matrix computations via data compression
inferred← citeshttps://doi.org/10.1145/1242572.1242628openalex-snapshot
Efficient search in large textual collections with redundancy
inferred← citeshttps://doi.org/10.1145/1361684.1361688openalex-snapshot
Incremental cluster-based retrieval using compressed cluster-skipping inverted files
inferred← citeshttps://doi.org/10.1145/1526709.1526764openalex-snapshot
Inverted index compression and query processing with optimized document ordering
inferred← citeshttps://doi.org/10.1145/1526709.1526770openalex-snapshot
Compressed web indexes
inferred← citeshttps://doi.org/10.1145/1557019.1557049openalex-snapshot
On compressing social networks
inferred← citeshttps://doi.org/10.1145/1571941.1571969openalex-snapshot
Compressing term positions in web indexes
inferred← citeshttps://doi.org/10.1145/1645953.1646008openalex-snapshot
Compact full-text indexing of versioned document collections
inferred← citeshttps://doi.org/10.1145/1772690.1772723openalex-snapshot
Scalable techniques for document identifier assignment in inverted indexes
inferred← citeshttps://doi.org/10.1145/1871437.1871594openalex-snapshot
Improved index compression techniques for versioned document collections
inferred← citeshttps://doi.org/10.1145/1877766.1877768openalex-snapshot
Engineering basic algorithms of an in-memory text search engine
inferred← citeshttps://doi.org/10.1145/1963405.1963475openalex-snapshot
Inverted index compression via online document routing
inferred← citeshttps://doi.org/10.1145/1993636.1993717openalex-snapshot
Almost tight bounds for reordering buffer management
inferred← citeshttps://doi.org/10.1145/2009916.2009993openalex-snapshot
Faster temporal range queries over versioned text
inferred← citeshttps://doi.org/10.1145/2009916.2010108openalex-snapshot
Effect of different docid orderings on dynamic pruning retrieval strategies
inferred← citeshttps://doi.org/10.1145/2213977.2214031openalex-snapshot
Optimal online buffer scheduling for block devices
inferred← citeshttps://doi.org/10.1145/2433396.2433409openalex-snapshot
Quasi-succinct indices
inferred← citeshttps://doi.org/10.1145/2484028.2484079openalex-snapshot
Document identifier reassignment and run-length-compressed inverted indexes for improved search performance
inferred← citeshttps://doi.org/10.1145/2600428.2609609openalex-snapshot
Skewed partial bitvectors for list intersection
inferred← citeshttps://doi.org/10.1145/2663347openalex-snapshot
An Improved Competitive Algorithm for Reordering Buffer Management
inferred← citeshttps://doi.org/10.1145/2675354.2675358openalex-snapshot
What, where, and when
inferred← citeshttps://doi.org/10.1145/2911451.2911518openalex-snapshot
Leveraging Context-Free Grammar for Efficient Inverted Index Compression
inferred← citeshttps://doi.org/10.1145/2939672.2939862openalex-snapshot
Compressing Graphs and Indexes with Recursive Graph Bisection
inferred← citeshttps://doi.org/10.1145/3103010.3103022openalex-snapshot
Small-Term Distribution for Disk-Based Search
inferred← citeshttps://doi.org/10.1145/3209978.3210066openalex-snapshot
Split-Lists and Initial Thresholds for WAND-based Search
inferred← citeshttps://doi.org/10.1145/3291992.3292001openalex-snapshot
Elias Revisited
inferred← citeshttps://doi.org/10.1145/3301409openalex-snapshot
FlexSaaS
inferred← citeshttps://doi.org/10.1145/3404835.3462991openalex-snapshot
Faster Index Reordering with Bipartite Graph Partitioning
inferred← citeshttps://doi.org/10.1145/3415148openalex-snapshot
Techniques for Inverted Index Compression
inferred← citeshttps://doi.org/10.1145/3539618.3591806openalex-snapshot
Profiling and Visualizing Dynamic Pruning Algorithms
inferred← citeshttps://doi.org/10.1145/3726302.3730248openalex-snapshot
Score-Fitted Indexes and Constant Length Indexes for Information Retrieval
inferred← citeshttps://doi.org/10.1145/967900.968024openalex-snapshot
Assigning document identifiers to enhance compressibility of Web Search Engines indexes
inferred← citeshttps://doi.org/10.1184/r1/6603281openalex-snapshot
An Experimental Analysis of a Compact Graph Representation
inferred← citeshttps://doi.org/10.1184/r1/6604220openalex-snapshot
Compact Representations of Ordered Sets
inferred← citeshttps://doi.org/10.1184/r1/6604223openalex-snapshot
Compact Representations of Separable Graphs
inferred← citeshttps://doi.org/10.14778/2002974.2002975openalex-snapshot
Efficient parallel lists intersection and index compression algorithms using graphics processing units
inferred← citeshttps://doi.org/10.14778/2536258.2536264openalex-snapshot
Bitlist
inferred← citeshttps://doi.org/10.14778/3303753.3303755openalex-snapshot
Document reordering for faster intersection
inferred← citeshttps://doi.org/10.25439/rmt.27585741openalex-snapshot
Search engine optimisation using past queries
inferred← citeshttps://doi.org/10.3390/math12091328openalex-snapshot
Efficient List Intersection Algorithm for Short Documents by Document Reordering
inferred← citeshttps://doi.org/10.3934/medsci.2017.4.426openalex-snapshot
Space Efficient Data Structures for N-gram Retrieval
inferred← citeshttps://doi.org/10.4018/jdm.2014010101openalex-snapshot
Compression Schemes with Data Reordering for Ordered Data
inferred← citeshttps://doi.org/10.48550/arxiv.0801.2378openalex-snapshot
String algorithms and data structures
inferred← citeshttps://doi.org/10.48550/arxiv.0911.4981openalex-snapshot
Efficient Fully-Compressed Sequence Representations
inferred← citeshttps://doi.org/10.48550/arxiv.1107.5661openalex-snapshot
On the Impact of Random Index-Partitioning on Index Compression
inferred← citeshttps://doi.org/10.48550/arxiv.1204.5823openalex-snapshot
A Bicriteria Approximation for the Reordering Buffer Problem
inferred← citeshttps://doi.org/10.5555/1339264.1339691openalex-snapshot
Document Classification Based on the Topic Evaluation and Its Usage in Data Compression
inferred← citeshttps://doi.org/10.5555/1873601.1873603openalex-snapshot
An improved competitive algorithm for reordering buffer management
inferred← citeshttps://doi.org/10.5772/8365openalex-snapshot
Document Compression Improvements Based on Data Clustering
inferred← citeshttps://doi.org/10.7275/qc1p-pd82openalex-snapshot
Query-Time Optimization Techniques for Structured Queries in Information Retrieval
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.