On the public citation graph

Organization and maintenance of large ordered indexes

0 signed · 1188 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.1109/pgec.1963.263589openalex-snapshot
The Balanced Tree and Its Utilization in Information Retrieval
inferredcites →https://doi.org/10.1145/357980.357987openalex-snapshot
Use of tree structures for processing files
inferredcites →https://doi.org/10.1145/366552.366600openalex-snapshot
Use of tree structures for processing files
inferredcites →https://doi.org/10.1145/800197.806043openalex-snapshot
Information retrieval

What points at this work

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

inferred← citeshttps://doi.org/10.5281/zenodo.18296790zenodo-depositor-declared
Why All Large-Scale Search Systems Converge: The Russian Dolls Limit
inferred← citeshttps://doi.org/10.1002/1097-024x(20000725)30:9<973::aid-spe325>3.0.co;2-9openalex-snapshot
An index allocation tool for object-oriented database systems
inferred← citeshttps://doi.org/10.1002/3527600434.eap076openalex-snapshot
Computer Databases
inferred← citeshttps://doi.org/10.1002/9780470050118.ecse569openalex-snapshot
File Organizations
inferred← citeshttps://doi.org/10.1002/9781119970231.ch7openalex-snapshot
Semantic Web Languages
inferred← citeshttps://doi.org/10.1002/9781119970231.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1002/cpe.3882openalex-snapshot
A multi‐channel architecture for metadata management in cloud storage systems by binding CPU‐cores to disks
inferred← citeshttps://doi.org/10.1002/cpe.5643openalex-snapshot
Specializing parallel data structures for Datalog
inferred← citeshttps://doi.org/10.1002/csc2.20248openalex-snapshot
From bits to bites: Advancement of the Germinate platform to support prebreeding informatics for crop wild relatives
inferred← citeshttps://doi.org/10.1002/j.1538-7305.1983.tb03469.xopenalex-snapshot
Two New Kinds of Biased Search Trees
inferred← citeshttps://doi.org/10.1002/nem.2097openalex-snapshot
A survey on indexing techniques for mobility in Internet of Things': Challenges, performances, and perspectives
inferred← citeshttps://doi.org/10.1002/scj.4690270101openalex-snapshot
Organization of a file system using class name expressions based on a B‐tree
inferred← citeshttps://doi.org/10.1002/sec.839openalex-snapshot
The approaches to contextual transaction trust computation in e‐Commerce environments
inferred← citeshttps://doi.org/10.1002/spe.2314openalex-snapshot
Practically efficient array initialization
inferred← citeshttps://doi.org/10.1002/spe.2666openalex-snapshot
An integration approach of hybrid databases based on SQL in cloud computing environment
inferred← citeshttps://doi.org/10.1002/spe.394openalex-snapshot
Self‐adjusting trees in practice for large text collections
inferred← citeshttps://doi.org/10.1002/spe.4380110502openalex-snapshot
A design language for the definition of a retrieval system interface for casual users of a relational database
inferred← citeshttps://doi.org/10.1002/spe.4380111208openalex-snapshot
Micro MUMPS: An interactive database language for micro‐computers
inferred← citeshttps://doi.org/10.1002/spe.4380130306openalex-snapshot
Algorithms for a persistent heap
inferred← citeshttps://doi.org/10.1002/spe.4380130307openalex-snapshot
CMS—A chunk management system
inferred← citeshttps://doi.org/10.1002/spe.4380170302openalex-snapshot
Implementing an extended functional data model using PS‐algol
inferred← citeshttps://doi.org/10.1002/spe.4380200503openalex-snapshot
LexAGen: An interactive incremental scanner generator
inferred← citeshttps://doi.org/10.1002/spe.844openalex-snapshot
S TXXL : standard template library for XXL data sets
inferred← citeshttps://doi.org/10.1006/inco.1996.0087openalex-snapshot
On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications
inferred← citeshttps://doi.org/10.1006/jcss.1997.1474openalex-snapshot
When Can We Sort ino(nlogn) Time?
inferred← citeshttps://doi.org/10.1006/jcss.1997.1511openalex-snapshot
Amortization Results for Chromatic Search Trees, with an Application to Priority Queues
inferred← citeshttps://doi.org/10.1006/jcss.2000.1705openalex-snapshot
AVL Trees with Relaxed Balance
inferred← citeshttps://doi.org/10.1006/jcss.2000.1709openalex-snapshot
Efficient Searching with Linear Constraints
inferred← citeshttps://doi.org/10.1006/jcss.2000.1721openalex-snapshot
A Process-Calculus Analysis of Concurrent Operations on B-Trees
inferred← citeshttps://doi.org/10.1006/jpdc.1994.1154openalex-snapshot
Parallel Construction of (a, b)-Trees
inferred← citeshttps://doi.org/10.1006/jpdc.1996.0160openalex-snapshot
Parallel Implementation of Tree Skeletons
inferred← citeshttps://doi.org/10.1007/11427186_49openalex-snapshot
How to Splay for loglogN-Competitiveness
inferred← citeshttps://doi.org/10.1007/11575832_9openalex-snapshot
Towards Real-Time Suffix Tree Construction
inferred← citeshttps://doi.org/10.1007/11602569_8openalex-snapshot
Search-Optimized Suffix-Tree Storage for Biological Applications
inferred← citeshttps://doi.org/10.1007/11602613_33openalex-snapshot
ISB-Tree: A New Indexing Scheme with Efficient Expected Behaviour
inferred← citeshttps://doi.org/10.1007/11603771_9openalex-snapshot
CLUR-Tree for Supporting Frequent Updates of Data Stream over Sensor Networks
inferred← citeshttps://doi.org/10.1007/11752578_11openalex-snapshot
Massive Concurrent Deletion of Keys in B*-Tree
inferred← citeshttps://doi.org/10.1007/11841036_63openalex-snapshot
Skewed Binary Search Trees
inferred← citeshttps://doi.org/10.1007/11940128_29openalex-snapshot
Poketree: A Dynamically Competitive Data Structure with Good Worst-Case Performance
inferred← citeshttps://doi.org/10.1007/3-540-06473-7_37openalex-snapshot
Gibt es ein Alternativkonzept zu den Datenbanktechniken der Data Base Task Group (CODASYL)?
inferred← citeshttps://doi.org/10.1007/3-540-07410-4_617openalex-snapshot
Information systems: A survey by examples
inferred← citeshttps://doi.org/10.1007/3-540-07612-3_3openalex-snapshot
Data base research: A survey
inferred← citeshttps://doi.org/10.1007/3-540-08353-7_131openalex-snapshot
Tree-structures for set manipulation problems
inferred← citeshttps://doi.org/10.1007/3-540-08934-9_104openalex-snapshot
Operation and evolution of organizational information systems
inferred← citeshttps://doi.org/10.1007/3-540-08934-9_92openalex-snapshot
The reference string indexing method
inferred← citeshttps://doi.org/10.1007/3-540-09118-1_22openalex-snapshot
Sorting presorted files
inferred← citeshttps://doi.org/10.1007/3-540-09526-8_39openalex-snapshot
A uniform approach to balanced binary and multiway trees
inferred← citeshttps://doi.org/10.1007/3-540-09981-6_15openalex-snapshot
Concurrent operations in large ordered indexes
inferred← citeshttps://doi.org/10.1007/3-540-10291-4_8openalex-snapshot
A new data structure for representing sorted lists
inferred← citeshttps://doi.org/10.1007/3-540-10828-9_53openalex-snapshot
Trees as data and file structures
inferred← citeshttps://doi.org/10.1007/3-540-16766-8_28openalex-snapshot
A comparative study of concurrency control methods in B-trees
inferred← citeshttps://doi.org/10.1007/3-540-19074-0_60openalex-snapshot
Multilevel trie hashing
inferred← citeshttps://doi.org/10.1007/3-540-19422-3_7openalex-snapshot
Priority search trees in secondary memory (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-27468-5_51openalex-snapshot
Towards an Integrated Concept for Geographical Information Systems in Disaster Management
inferred← citeshttps://doi.org/10.1007/3-540-32743-6_6openalex-snapshot
Data Everywhere — Der lange Weg von Datensammlungen zu Datenbanksystemen
inferred← citeshttps://doi.org/10.1007/3-540-36136-7_20openalex-snapshot
Funnel Heap-A Cache Oblivious Priority Queue
inferred← citeshttps://doi.org/10.1007/3-540-38076-0_5openalex-snapshot
The Opsis Project: Materialized Views for Data Warehouses and the Web
inferred← citeshttps://doi.org/10.1007/3-540-44466-1_24openalex-snapshot
Optimal Multidimensional Query Processing Using Tree Striping
inferred← citeshttps://doi.org/10.1007/3-540-44676-1_1openalex-snapshot
External Memory Data Structures
inferred← citeshttps://doi.org/10.1007/3-540-45446-2_17openalex-snapshot
Complexity of Layered Binary Search Trees with Relaxed Balance
inferred← citeshttps://doi.org/10.1007/3-540-45446-2_19openalex-snapshot
Exponentially Decreasing Number of Operations in Balanced Trees
inferred← citeshttps://doi.org/10.1007/3-540-45465-9_18openalex-snapshot
Exponential Structures for Efficient Cache-Oblivious Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-45465-9_37openalex-snapshot
Cache Oblivious Distribution Sweeping
inferred← citeshttps://doi.org/10.1007/3-540-45498-5_15openalex-snapshot
A Comparison of Two Persistent Storage Tools for Implementing a Search Engine
inferred← citeshttps://doi.org/10.1007/3-540-45749-6_18openalex-snapshot
Efficient Tree Layout in a Multilevel Memory Hierarchy
inferred← citeshttps://doi.org/10.1007/3-540-46093-4_15openalex-snapshot
View Serializable Updates of Concurrent Index Structures
inferred← citeshttps://doi.org/10.1007/3-540-46632-0_2openalex-snapshot
General Splay: A Basic Theory and Calculus
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_10openalex-snapshot
A Framework for Index Bulk Loading and Dynamization
inferred← citeshttps://doi.org/10.1007/3-540-48318-7_19openalex-snapshot
LEDA-SM: Extending LEDA to Secondary Memory
inferred← citeshttps://doi.org/10.1007/3-540-48318-7_27openalex-snapshot
An Experimental Study of Priority Queues in External Memory
inferred← citeshttps://doi.org/10.1007/3-540-48447-7_35openalex-snapshot
Online Data Structures in External Memory
inferred← citeshttps://doi.org/10.1007/3-540-48481-7_30openalex-snapshot
Efficient Searching for Multi—dimensional Data Made Simple
inferred← citeshttps://doi.org/10.1007/3-540-48518-x_20openalex-snapshot
Efficient Bulk Operations on Dynamic R-trees
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_10openalex-snapshot
Online Data Structures in External Memory
inferred← citeshttps://doi.org/10.1007/3-540-50335-8_26openalex-snapshot
Internal and external algorithms for the points-in-regions problem — the INSIDE join of geo-relational algebra
inferred← citeshttps://doi.org/10.1007/3-540-51498-8_35openalex-snapshot
Analysis of compact 0-complete trees: A new access method to large databases
inferred← citeshttps://doi.org/10.1007/3-540-52208-5_19openalex-snapshot
7±2 criteria for assessing and comparing spatial data structures
inferred← citeshttps://doi.org/10.1007/3-540-52208-5_31openalex-snapshot
An object-oriented approach to the design of geographic information systems
inferred← citeshttps://doi.org/10.1007/3-540-52292-1_19openalex-snapshot
Paging binary trees with external balancing
inferred← citeshttps://doi.org/10.1007/3-540-52846-6_83openalex-snapshot
How to update a balanced binary tree with a constant number of rotations
inferred← citeshttps://doi.org/10.1007/3-540-53504-7_84openalex-snapshot
Alternatives to the B+- tree
inferred← citeshttps://doi.org/10.1007/3-540-54009-1_13openalex-snapshot
The Nested Interpolation Based Grid File
inferred← citeshttps://doi.org/10.1007/3-540-54414-3_38openalex-snapshot
Grow and post index trees: Role, techniques and future potential
inferred← citeshttps://doi.org/10.1007/3-540-54945-5_71openalex-snapshot
Comparison-efficient and write-optimal searching and sorting
inferred← citeshttps://doi.org/10.1007/3-540-55488-2_23openalex-snapshot
A flexible and extensible index manager for spatial database systems
inferred← citeshttps://doi.org/10.1007/3-540-55706-7_14openalex-snapshot
Efficient rebalancing of chromatic search trees
inferred← citeshttps://doi.org/10.1007/3-540-55706-7_17openalex-snapshot
Gkd-trees: Binary trees that combine multi-dimensional data handling, node size and fringe reorganization
inferred← citeshttps://doi.org/10.1007/3-540-55895-0_454openalex-snapshot
Parallel searching for 3D-objects
inferred← citeshttps://doi.org/10.1007/3-540-56039-4_57openalex-snapshot
Maintaining dictionaries: Space-saving modifications of B-trees
inferred← citeshttps://doi.org/10.1007/3-540-56869-7_29openalex-snapshot
Indexing on spherical surfaces using semi-quadcodes
inferred← citeshttps://doi.org/10.1007/3-540-57301-1_11openalex-snapshot
Data structure and algorithms for new hardware technology
inferred← citeshttps://doi.org/10.1007/3-540-57529-4_74openalex-snapshot
A simple file structure for the weighted dictionary problem
inferred← citeshttps://doi.org/10.1007/3-540-57818-8_48openalex-snapshot
Indexing alternatives for multiversion locking
inferred← citeshttps://doi.org/10.1007/3-540-57887-0_92openalex-snapshot
Constraint programming and database query languages
inferred← citeshttps://doi.org/10.1007/3-540-58218-5_5openalex-snapshot
A new algorithm for the construction of optimal B-trees
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_67openalex-snapshot
On the construction of classes of suffix trees for square matrices: Algorithms and applications
inferred← citeshttps://doi.org/10.1007/3-540-60220-8_69openalex-snapshot
Amortization results for chromatic search trees, with an application to priority queues
inferred← citeshttps://doi.org/10.1007/3-540-60220-8_74openalex-snapshot
The buffer tree: A new technique for optimal I/O-algorithms
inferred← citeshttps://doi.org/10.1007/3-540-60220-8_75openalex-snapshot
Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep
inferred← citeshttps://doi.org/10.1007/3-540-60794-3_16openalex-snapshot
The application of multi-dimensional indexing methods to constraints
inferred← citeshttps://doi.org/10.1007/3-540-60922-9_47openalex-snapshot
Ranking and unranking trees using regular reductions
inferred← citeshttps://doi.org/10.1007/3-540-62222-5_61openalex-snapshot
Efficient indexing for constraint and temporal databases
inferred← citeshttps://doi.org/10.1007/3-540-62501-1_39openalex-snapshot
Implementing index data structures using constraint logic programming
inferred← citeshttps://doi.org/10.1007/3-540-62592-5_72openalex-snapshot
Relaxed balanced red-black trees
inferred← citeshttps://doi.org/10.1007/3-540-63141-0_25openalex-snapshot
A rigorous analysis of concurrent operations on B-trees
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_215openalex-snapshot
Efficient splitting and merging algorithms for order decomposable problems
inferred← citeshttps://doi.org/10.1007/3-540-63397-9_27openalex-snapshot
Relaxed balance for search trees with local rebalancing
inferred← citeshttps://doi.org/10.1007/3-540-63792-3_1openalex-snapshot
Efficient data structures for deduction systems
inferred← citeshttps://doi.org/10.1007/3-540-63818-0_6openalex-snapshot
Spatial data structures: Concepts and design choices
inferred← citeshttps://doi.org/10.1007/3-540-63818-0_8openalex-snapshot
External-memory algorithms with applications in GIS
inferred← citeshttps://doi.org/10.1007/3-540-68530-8_1openalex-snapshot
External Memory Algorithms
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_190openalex-snapshot
I/O-model
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_57openalex-snapshot
B-trees
inferred← citeshttps://doi.org/10.1007/978-0-387-35285-5_12openalex-snapshot
A Two-tier Coarse Indexing Scheme for MLS Database Systems
inferred← citeshttps://doi.org/10.1007/978-0-387-39940-9_738openalex-snapshot
Indexed Sequential Access Method
inferred← citeshttps://doi.org/10.1007/978-0-387-39940-9_739openalex-snapshot
B+-Tree
inferred← citeshttps://doi.org/10.1007/978-1-349-21151-7_4openalex-snapshot
Non-linear ADTs—Trees
inferred← citeshttps://doi.org/10.1007/978-1-4020-5347-4_5openalex-snapshot
THE HYBRID DIGITAL TREE
inferred← citeshttps://doi.org/10.1007/978-1-4020-6268-1_37openalex-snapshot
Towards Logarithmic Search Time Complexity for R-Trees
inferred← citeshttps://doi.org/10.1007/978-1-4419-8590-3_11openalex-snapshot
Parallel Index Structures
inferred← citeshttps://doi.org/10.1007/978-1-4419-8590-3_3openalex-snapshot
Fundamental Access Methods
inferred← citeshttps://doi.org/10.1007/978-1-4471-1616-5_3openalex-snapshot
Data Structures and Data Models
inferred← citeshttps://doi.org/10.1007/978-1-4471-3166-3_10openalex-snapshot
Referentially Transparent Database Languages
inferred← citeshttps://doi.org/10.1007/978-1-4471-4993-4_11openalex-snapshot
M-ary Trees for Combinatorial Asset Management Decision Problems
inferred← citeshttps://doi.org/10.1007/978-1-4612-4980-1_20openalex-snapshot
Database Management: A Survey
inferred← citeshttps://doi.org/10.1007/978-1-4613-1437-0_2openalex-snapshot
Correct Transformational Design of Concurrent Search Structures
inferred← citeshttps://doi.org/10.1007/978-1-4613-1881-1_6openalex-snapshot
Trie Hashing : Further Properties and Performance
inferred← citeshttps://doi.org/10.1007/978-1-4613-2369-3_2openalex-snapshot
An Overview of Database Management Technology
inferred← citeshttps://doi.org/10.1007/978-1-4613-3394-4_13openalex-snapshot
Relaxed Balancing in Search Trees
inferred← citeshttps://doi.org/10.1007/978-1-4613-9883-7_1openalex-snapshot
A Survey of File Organizations and Performance
inferred← citeshttps://doi.org/10.1007/978-1-4614-1168-0_10openalex-snapshot
Databases
inferred← citeshttps://doi.org/10.1007/978-1-4614-8265-9_738openalex-snapshot
Indexed Sequential Access Method
inferred← citeshttps://doi.org/10.1007/978-1-4614-8265-9_739openalex-snapshot
B+-Tree
inferred← citeshttps://doi.org/10.1007/978-1-4615-0005-6_28openalex-snapshot
Data Management in Environmental Information Systems
inferred← citeshttps://doi.org/10.1007/978-1-4615-0005-6_9openalex-snapshot
External Memory Data Structures
inferred← citeshttps://doi.org/10.1007/978-1-4757-4865-9_1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/978-1-4899-7993-3_738-2openalex-snapshot
Indexed Sequential Access Method
inferred← citeshttps://doi.org/10.1007/978-1-4899-7993-3_739-2openalex-snapshot
B+-Tree
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_190openalex-snapshot
I/O-Model
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_57openalex-snapshot
B-trees
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_632openalex-snapshot
Predecessor Search, String Algorithms and Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-030-10767-3_4openalex-snapshot
Social Network Sampling
inferred← citeshttps://doi.org/10.1007/978-3-030-12195-2_3openalex-snapshot
Image Indexing Techniques
inferred← citeshttps://doi.org/10.1007/978-3-030-16184-2_63openalex-snapshot
ND-GiST: A Novel Method for Disk-Resident k-mer Indexing
inferred← citeshttps://doi.org/10.1007/978-3-030-19955-5_9openalex-snapshot
Belga B-Trees
inferred← citeshttps://doi.org/10.1007/978-3-030-39469-1_6openalex-snapshot
Function Interpolation for Learned Index Structures
inferred← citeshttps://doi.org/10.1007/978-3-030-59419-0_23openalex-snapshot
HEGJoin: Heterogeneous CPU-GPU Epsilon Grids for Accelerated Distance Similarity Join
inferred← citeshttps://doi.org/10.1007/978-3-031-01873-2_1openalex-snapshot
On Transactional Concurrency Control
inferred← citeshttps://doi.org/10.1007/978-3-031-01873-2_2openalex-snapshot
A Survey of B-Tree Locking Techniques
inferred← citeshttps://doi.org/10.1007/978-3-031-17715-6_21openalex-snapshot
A Verified Implementation of B$$^+$$-Trees in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/978-3-031-34776-4_27openalex-snapshot
An Interactive Visualization System for Streaming Data Online Exploration
inferred← citeshttps://doi.org/10.1007/978-3-031-65494-7_4openalex-snapshot
Approaches for Writing HE Applications
inferred← citeshttps://doi.org/10.1007/978-3-031-81375-7_19openalex-snapshot
Optimizing B-Trees for Memory-Constrained Flash Embedded Devices
inferred← citeshttps://doi.org/10.1007/978-3-319-03089-0_14openalex-snapshot
Self-stabilizing Balancing Algorithm for Containment-Based Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-07079-7_3openalex-snapshot
Estimating the Kullback–Leibler Divergence
inferred← citeshttps://doi.org/10.1007/978-3-319-08010-9_8openalex-snapshot
A Generic Approach for Bulk Loading Trie-Based Index Structures on External Storage
inferred← citeshttps://doi.org/10.1007/978-3-319-08783-2_32openalex-snapshot
Approximating High-Dimensional Range Queries with kNN Indexing Techniques
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_10openalex-snapshot
Bulk Operations on B-Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_11openalex-snapshot
Online Index Construction and Maintenance
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_12openalex-snapshot
Concurrency Control by Versioning
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_13openalex-snapshot
Distributed Transactions
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_14openalex-snapshot
Transactions in Page-Server Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_15openalex-snapshot
Processing of Write-Intensive Transactions
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_2openalex-snapshot
Operations on the Physical Database
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_3openalex-snapshot
Logging and Buffering
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_4openalex-snapshot
Transaction Rollback and Restart Recovery
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_5openalex-snapshot
Transactional Isolation
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_6openalex-snapshot
Lock-Based Concurrency Control
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_7openalex-snapshot
B-Tree Traversals
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_8openalex-snapshot
B-Tree Structure Modifications
inferred← citeshttps://doi.org/10.1007/978-3-319-12292-2_9openalex-snapshot
Advanced Locking Protocols
inferred← citeshttps://doi.org/10.1007/978-3-319-13960-9_10openalex-snapshot
The DCB-Tree: A Space-Efficient Delta Coded Cache Conscious B-Tree
inferred← citeshttps://doi.org/10.1007/978-3-319-15579-1_45openalex-snapshot
Compressed Data Structures for Range Searching
inferred← citeshttps://doi.org/10.1007/978-3-319-17885-1_949openalex-snapshot
Pandemics, Detection and Management
inferred← citeshttps://doi.org/10.1007/978-3-319-21840-3_21openalex-snapshot
Cache-Oblivious Iterated Predecessor Queries via Range Coalescing
inferred← citeshttps://doi.org/10.1007/978-3-319-23519-6_602-2openalex-snapshot
Indexing, High Dimensional
inferred← citeshttps://doi.org/10.1007/978-3-319-27702-8_34openalex-snapshot
Building, Curating, and Querying Large-Scale Data Repositories for Field Robotics Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-55871-4_3openalex-snapshot
Digital Recording
inferred← citeshttps://doi.org/10.1007/978-3-319-63962-8_255-1openalex-snapshot
Big Data Indexing
inferred← citeshttps://doi.org/10.1007/978-3-319-65482-9_32openalex-snapshot
Interval Merging Binary Tree
inferred← citeshttps://doi.org/10.1007/978-3-319-77525-8_255openalex-snapshot
Big Data Indexing
inferred← citeshttps://doi.org/10.1007/978-3-322-84936-6_9openalex-snapshot
Literatur
inferred← citeshttps://doi.org/10.1007/978-3-322-91855-0_4openalex-snapshot
Dynamische Datenstrukturen
inferred← citeshttps://doi.org/10.1007/978-3-322-91882-6_8openalex-snapshot
Externes Suchen und Sortieren
inferred← citeshttps://doi.org/10.1007/978-3-322-92105-5_8openalex-snapshot
Externes Suchen und Sortieren
inferred← citeshttps://doi.org/10.1007/978-3-322-92336-3_8openalex-snapshot
Datenbankschemata für multidimensionale Daten
inferred← citeshttps://doi.org/10.1007/978-3-322-96663-6_5openalex-snapshot
Dynamische Datenstrukturen
inferred← citeshttps://doi.org/10.1007/978-3-322-99372-4_5openalex-snapshot
Multidimensionale Datenstrukturen
inferred← citeshttps://doi.org/10.1007/978-3-540-24686-2_26openalex-snapshot
An Efficient B-Tree Layer for Flash-Memory Storage Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-24698-5_50openalex-snapshot
A Simplified and Dynamic Unified Structure
inferred← citeshttps://doi.org/10.1007/978-3-540-27810-8_2openalex-snapshot
Cache-Oblivious Algorithms and Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-28649-3_46openalex-snapshot
Fast Statistically Geometric Reasoning About Uncertain Line Segments in 2D- and 3D-Space
inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_4openalex-snapshot
I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries
inferred← citeshttps://doi.org/10.1007/978-3-540-39737-3_28openalex-snapshot
A Robust Scheme for Multilevel Extendible Hashing
inferred← citeshttps://doi.org/10.1007/978-3-540-45072-6_5openalex-snapshot
Efficient Object-Relational Interval Management and Beyond
inferred← citeshttps://doi.org/10.1007/978-3-540-45080-1_94openalex-snapshot
Global B+ Tree Indexing in Parallel Database Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-49051-7_18openalex-snapshot
Virtual Cache Line: A New Technique to Improve Cache Exploitation for Recursive Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-68552-4_3openalex-snapshot
Comparing Integer Data Structures for 32 and 64 Bit Keys
inferred← citeshttps://doi.org/10.1007/978-3-540-69903-3_5openalex-snapshot
I/O Efficient Dynamic Data Structures for Longest Prefix Queries
inferred← citeshttps://doi.org/10.1007/978-3-540-75410-7_14openalex-snapshot
An Indexing Technique for Fuzzy Numerical Data
showing the first 200 of 1184 · page through all 1184
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.