Adding range restriction capability to dynamic data structures
Journal of the ACM (JACM)
Computational geometry: an introduction
Computational geometry: an introduction
Hash functions for priority queues
Information and Control
The ultimate planar convex hull algorithm
SIAM Journal on Computing
Key-sequence data sets on indelible storage
IBM Journal of Research and Development
Filtering search: a new approach to query answering
SIAM Journal on Computing
Synchronized Disk Interleaving
IEEE Transactions on Computers
A model for hierarchical memory
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The input/output complexity of sorting and related problems
Communications of the ACM
A simple bounded disorder file organization with good performance
ACM Transactions on Database Systems (TODS)
Tight bounds on the complexity of parallel sorting
IEEE Transactions on Computers
Expected behaviour of B+-trees under random insertions
Acta Informatica
Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Redundancy in spatial databases
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Applications of spatial data structures: Computer graphics, image processing, and GIS
Applications of spatial data structures: Computer graphics, image processing, and GIS
The design and analysis of spatial data structures
The design and analysis of spatial data structures
Lower bounds for orthogonal range searching: I. The reporting case
Journal of the ACM (JACM)
Introduction to algorithms
Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Readings in object-oriented database systems
Readings in object-oriented database systems
Proceedings of the sixteenth international conference on Very large databases
The buddy tree: an efficient and robust access method for spatial data base
Proceedings of the sixteenth international conference on Very large databases
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
The hB-tree: a multiattribute indexing method with good guaranteed performance
ACM Transactions on Database Systems (TODS)
Efficient memory access in large-scale computation (invited paper)
STACS 91 Proceedings of the 8th annual symposium on Theoretical aspects of computer science
Average-case analysis of algorithms and data structures
Handbook of theoretical computer science (vol. A)
I/O Overhead and Parallel VLSI Architectures for Lattice Computations
IEEE Transactions on Computers
Information retrieval: data structures and algorithms
Information retrieval: data structures and algorithms
An adaptive overflow technique to defer splitting in B-trees
The Computer Journal - Special issue on data structures
Management of large amounts of data in interactive building walkthroughs
I3D '92 Proceedings of the 1992 symposium on Interactive 3D graphics
Suffix arrays: a new method for on-line string searches
SIAM Journal on Computing
Large-scale sorting in uniform memory hierarchies
Journal of Parallel and Distributed Computing - Special issue on parallel I/O systems
Deterministic distribution sort in shared and distributed memory multiprocessors
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Partially preemptible hash joins
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
CIKM '93 Proceedings of the second international conference on Information and knowledge management
Deterministic sorting in nearly logarithmic time on the hypercube and related computers
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
RAID: high-performance, reliable secondary storage
ACM Computing Surveys (CSUR)
ATOM: a system for building customized program analysis tools
PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Path caching (extended abstract): a technique for optimal external searching
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Greed sort: optimal deterministic sorting on parallel disks
Journal of the ACM (JACM)
Partition based spatial-merge join
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Indexing for data models with constraints and classes
Journal of Computer and System Sciences
The Vesta parallel file system
ACM Transactions on Computer Systems (TOCS)
Bounds on the separation of two parallel disk models
Proceedings of the fourth workshop on I/O in parallel and distributed systems: part of the federated computing research conference
Efficient 3-D range searching in external memory
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Strategic directions in storage I/O issues in large-scale computing
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Multidimensional array I/O in Panda 1.0
The Journal of Supercomputing
Bounded disorder: the effect of the index
MFCS '94 Selected papers from the 19th international symposium on Mathematical foundations of computer science
Using the SimOS machine simulator to study complex computer systems
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Parallel Computing - Special double issue: parallel I/O
Simple randomized mergesort on parallel disks
Parallel Computing - Special double issue: parallel I/O
Characterizing concurrency control performance for the PIOUS parallel file system
Journal of Parallel and Distributed Computing
Efficient external memory algorithms by simulating coarse-grained parallel algorithms
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
On sorting strings in external memory (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Locality-preserving hashing in multidimensional spaces
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
On the analysis of indexing schemes
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Sparsification—a technique for speeding up dynamic graph algorithms
Journal of the ACM (JACM)
A lower bound theorem for indexing schemes and its application to multidimensional range queries
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Tight bounds for 2-dimensional indexing schemes
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Efficient searching with linear constraints
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Performing out-of-core FFTs on parallel disk systems
Parallel Computing - Special issues on applications: parallel data servers and applications
Randomized external-memory algorithms for some geometric problems
Proceedings of the fourteenth annual symposium on Computational geometry
Blocking in parallel multisearch problems (extended abstract)
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
An analytic behavior model for disk drives with readahead caches and request reordering
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Multidimensional access methods
ACM Computing Surveys (CSUR)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Data cube approximation and histograms via wavelets
Proceedings of the seventh international conference on Information and knowledge management
Computational Geometry: Theory and Applications
Active disks: programming model, algorithms and evaluation
Proceedings of the eighth international conference on Architectural support for programming languages and operating systems
Dynamic dictionary matching in external memory
Information and Computation
Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
SIAM Journal on Computing
Constraint query languages (preliminary report)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Modeling and optimizing I/O throughput of multiple disks on a bus
SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Optimal read-once parallel disk scheduling
Proceedings of the sixth workshop on I/O in parallel and distributed systems
The string B-tree: a new data structure for string search in external memory and its applications
Journal of the ACM (JACM)
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On two-dimensional indexability and optimal range search indexing
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Approximate computation of multidimensional aggregates of sparse data using wavelets
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
DOMINO: databases fOr MovINg Objects tracking
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
A simple and efficient parallel disk mergesort
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
External-memory graph algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
The P-range tree: a new data structure for range searching in secondary memory
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Fast string searching in secondary storage: theoretical developments and experimental results
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Efficient suffix trees on secondary storage
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Data structures for mobile data
Journal of Algorithms
I/O-efficient dynamic point location in monotone planar subdivisions
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Optimal parallel sorting in multi-level storage
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
I/O-efficient algorithms for contour-line extraction and planar graph blocking
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
I/O-complexity of graph algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Theory and practice of I/O-efficient algorithms for multidimensional batched searching problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
Efficient locking for concurrent operations on B-trees
ACM Transactions on Database Systems (TODS)
Performance analysis of linear hashing with partial expansions
ACM Transactions on Database Systems (TODS)
Comparison of access methods for time-evolving data
ACM Computing Surveys (CSUR)
Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric
Journal of the ACM (JACM)
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
External memory algorithms and data structures
External memory algorithms
Efficient cross-trees for external memory
External memory algorithms
External memory algorithms
I/O-optimal computation of segment intersections
External memory algorithms
On showing lower bounds for external-memory computational geometry problems
External memory algorithms
A survey of out-of-core algorithms in numerical linear algebra
External memory algorithms
External memory techniques for isosurface extraction in scientific visualization
External memory algorithms
ACM Computing Surveys (CSUR)
Indexing moving points (extended abstract)
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Indexing the positions of continuously moving objects
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Making B+- trees cache conscious in main memory
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
I/O-efficient dynamic planar point location (extended abstract)
Proceedings of the sixteenth annual symposium on Computational geometry
Towards a theory of cache-efficient algorithms
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Fast concurrent access to parallel disks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
On external memory graph traversal
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Modeling and performance of MEMS-based storage devices
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Competitive parallel disk prefetching and buffer management
Journal of Algorithms
ACM Computing Surveys (CSUR)
An effective way to represent quadtrees
Communications of the ACM
Multidimensional divide-and-conquer
Communications of the ACM
A fast string searching algorithm
Communications of the ACM
Reconciling simplicity and realism in parallel disk models
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Distribution sort with randomized cycle
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
External memory BFS on undirected graphs with bounded degree
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
I/O-efficient algorithms for graphs of bounded treewidth
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Maintaining approximate extent measures of moving points
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Box-trees and R-trees with near-optimal query time
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Optimal prefetching and caching for parallel I/O sytems
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
The power of duality for prefetching and sorting with parallel disks
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Designing computer systems with MEMS-based storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Parallel sorting on a shared-nothing architecture using probabilistic splitting
PDIS '91 Proceedings of the first international conference on Parallel and distributed information systems
Design of Dynamic Data Structures
Design of Dynamic Data Structures
Modern Information Retrieval
The K-D-B-tree: a search structure for large multidimensional dynamic indexes
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
A class of data structures for associative searching
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Performance of B±Trees with Partial Expansions
IEEE Transactions on Knowledge and Data Engineering
An Efficient Multiversion Access Structure
IEEE Transactions on Knowledge and Data Engineering
Analysis of linear hashing revisited
Nordic Journal of Computing
Improving the Query Performance of High-Dimensional Index Structures by Bulk-Load Operations
EDBT '98 Proceedings of the 6th International Conference on Extending Database Technology: Advances in Database Technology
An Implementation and Performance Analysis of Spatial Data Access Methods
Proceedings of the Fifth International Conference on Data Engineering
Proceedings of the Second International Conference on Data Engineering
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
Dynamic Memory Adjustment for External Mergesort
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
A Generic Approach to Bulk Loading Multidimensional Index Structures
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Scalable Sweeping-Based Spatial Join
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Active Storage for Large-Scale Data Mining and Multimedia
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Cache Conscious Indexing for Decision-Support in Main Memory
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Similarity Search in High Dimensions via Hashing
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Novel Approaches in Query Processing for Moving Object Trajectories
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Worst-Case External-Memory Priority Queues
SWAT '98 Proceedings of the 6th Scandinavian Workshop on Algorithm Theory
Memory-Adaptive External Sorting
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract)
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Topology B-Trees and Their Applications
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Hilbert R-tree: An Improved R-tree using Fractals
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Efficient Splitting and Merging Algorithms for Order Decomposable Problems (Extended Abstract)
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Further Computational Geometry in Secondary Memory
ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation
ISAAC '95 Proceedings of the 6th International Symposium on Algorithms and Computation
Extending the Hong-Kung Model to Memory Hierarchies
COCOON '95 Proceedings of the First Annual International Conference on Computing and Combinatorics
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
On Constructing Suffix Arrays in External Memory
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
BSP-Like External-Memory Computation
CIAC '97 Proceedings of the Third Italian Conference on Algorithms and Complexity
External-Memory Algorithms with Applications in GIS
Algorithmic Foundations of Geographic Information Systems, this book originated from the CISM Advanced School on the Algorithmic Foundations of Geographic Information Systems
Spatial Data Structures: Concepts and Design Choices
Algorithmic Foundations of Geographic Information Systems, this book originated from the CISM Advanced School on the Algorithmic Foundations of Geographic Information Systems
A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
The hB $^\Pi$-tree: a multi-attribute index supporting concurrency, recovery and node consolidation
The VLDB Journal — The International Journal on Very Large Data Bases
Concurrency and recovery for index trees
The VLDB Journal — The International Journal on Very Large Data Bases
An asymptotically optimal multiversion B-tree
The VLDB Journal — The International Journal on Very Large Data Bases
Overcoming the Memory Bottleneck in Suffix Tree Construction
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Towards an Optimal Bit-Reversal Permutation Program
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
A Theoretical Framework for Memory-Adaptive Algorithms
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
An Approximate L1-Difference Algorithm for Massive Data Streams
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
I/O complexity: The red-blue pebble game
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
ViC*: A Compiler for Virtual-Memory C*
HIPS '98 Proceedings of the High-Level Parallel Programming Models and Supportive Environments
The parallel I/O architecture of the high-performance storage system (HPSS)
MSS '95 Proceedings of the 14th IEEE Symposium on Mass Storage Systems
Improved Algorithms and Data Structures for Solving Graph Problems in External Memory
SPDP '96 Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing (SPDP '96)
Scalable Mining for Classification Rules in Relational Databases
IDEAS '98 Proceedings of the 1998 International Symposium on Database Engineering & Applications
An API for Choreographing Data Accesses
An API for Choreographing Data Accesses
Optimal dynamic interval management in external memory
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
New coding techniques for improved bandwidth utilization
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Spiral Storage: Incrementally Augmentable Hash Addressed Storage
Spiral Storage: Incrementally Augmentable Hash Addressed Storage
File system logging versus clustering: a performance comparison
TCON'95 Proceedings of the USENIX 1995 Technical Conference Proceedings
The "Millipede": more than one thousand tips for future AFM data storage
IBM Journal of Research and Development
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
An external memory data structure for shortest path queries (extended abstract)
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Two-dimensional substring indexing
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The power of duality for prefetching and sorting with parallel disks
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Cache-oblivious priority queue and graph algorithm applications
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Efficient aggregation over objects with extent
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Interactive sculpturing and visualization of unbounded voxel volumes
Proceedings of the seventh ACM symposium on Solid modeling and applications
Global static indexing for real-time exploration of very large regular grids
Proceedings of the 2001 ACM/IEEE conference on Supercomputing
Visualization of large terrains made easy
Proceedings of the conference on Visualization '01
High-performance data mining with skeleton-based structured parallel programming
Parallel Computing - Parallel data-intensive algorithms and applications
Terrain Simplification Simplified: A General Framework for View-Dependent Out-of-Core Visualization
IEEE Transactions on Visualization and Computer Graphics
Lower bounds for external memory dictionaries
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
The set-associative cache performance of search trees
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
On the Discovery of Weak Periodicities in Large Time Series
PKDD '02 Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery
Exponential Structures for Efficient Cache-Oblivious Algorithms
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Cache Oblivious Distribution Sweeping
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Funnel Heap - A Cache Oblivious Priority Queue
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Optimised Predecessor Data Structures for Internal Memory
WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
Analysing the Cache Behaviour of Non-uniform Distribution Sorting Algorithms
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Implementing I/O-efficient Data Structures Using TPIE
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
I/O-efficient topological sorting of planar DAGs
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Cache-oblivious data structures for orthogonal range searching
Proceedings of the nineteenth annual symposium on Computational geometry
Handbook of massive data sets
On the limits of cache-obliviousness
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On finding common neighborhoods in massive graphs
Theoretical Computer Science
Distributed Computing with Load-Managed Active Storage
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Efficient Flow Computation on Massive Grid Terrain Datasets
Geoinformatica
Adapting Radix Sort to the Memory Hierarchy
Journal of Experimental Algorithmics (JEA)
Parallel ROLAP Data Cube Construction on Shared-Nothing Multiprocessors
Distributed and Parallel Databases
Bulk Operations for Space-Partitioning Trees
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Cache-oblivious shortest paths in graphs using buffer heap
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Online algorithms for prefetching and caching on parallel disks
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
I/O-efficient dynamic planar point location
Computational Geometry: Theory and Applications
A novel improvement to the R*-tree spatial index using gain/loss metrics
Proceedings of the 12th annual ACM international workshop on Geographic information systems
Interactive Exploration of Large Remote Micro-CT Scans
VIS '04 Proceedings of the conference on Visualization '04
Journal of Experimental Algorithmics (JEA)
Journal of the ACM (JACM)
Big Wins with Small Application-Aware Caches
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
Building on a Framework: Using FG for More Flexibility and Improved Performance in Parallel Programs
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
External-memory depth-first search algorithm for solid grid graphs
Information Processing Letters
Cache-oblivious planar orthogonal range searching and counting
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Lower bounds for sorting with few random accesses to external memory
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Periodicity Detection in Time Series Databases
IEEE Transactions on Knowledge and Data Engineering
ACM SIGGRAPH 2005 Papers
Out-of-Core Isosurface Extraction of Time-Varying Fields over Irregular Grids
Proceedings of the 14th IEEE Visualization 2003 (VIS'03)
Space efficiency in synopsis construction algorithms
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Improving the R*-tree with outlier handling techniques
Proceedings of the 13th annual ACM international workshop on Geographic information systems
Cache-oblivious string dictionaries
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A computational study of external-memory BFS algorithms
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Trading off space for passes in graph streaming problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
To randomize or not to randomize: space optimal summaries for hyperlink analysis
Proceedings of the 15th international conference on World Wide Web
Simple and semi-dynamic structures for cache-oblivious planar orthogonal range searching
Proceedings of the twenty-second annual symposium on Computational geometry
I/O-efficient batched union-find and its applications to terrain analysis
Proceedings of the twenty-second annual symposium on Computational geometry
Engineering a compact parallel delaunay algorithm in 3D
Proceedings of the twenty-second annual symposium on Computational geometry
Illustrating the streaming construction of 2D delaunay triangulations
Proceedings of the twenty-second annual symposium on Computational geometry
Proceedings of the 2006 ACM symposium on Applied computing
Streaming computation of Delaunay triangulations
ACM SIGGRAPH 2006 Papers
Randomized computations on large data sets: tight lower bounds
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
GPUTeraSort: high performance graphics co-processor sorting for large database management
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Distribution sort with randomized cycling
Journal of the ACM (JACM)
Data streams: algorithms and applications
Foundations and Trends® in Theoretical Computer Science
A data structure for a sequence of string accesses in external memory
ACM Transactions on Algorithms (TALG)
Mesh Layouts for Block-Based Caches
IEEE Transactions on Visualization and Computer Graphics
A memory model for scientific algorithms on graphics processors
Proceedings of the 2006 ACM/IEEE conference on Supercomputing
Engineering a cache-oblivious sorting algorithm
Journal of Experimental Algorithmics (JEA)
Compression techniques for fast external sorting
The VLDB Journal — The International Journal on Very Large Data Bases
An external-memory depth-first search algorithm for general grid graphs
Theoretical Computer Science
Mining for weak periodic signals in time series databases
Intelligent Data Analysis
Detectives: detecting coalition hit inflation attacks in advertising networks streams
Proceedings of the 16th international conference on World Wide Web
On the importance of cache tuning in a cache-aware algorithm: A case study
Computers & Mathematics with Applications
Tight lower bounds for query processing on streaming and external memory data
Theoretical Computer Science
A parallel dynamic programming algorithm on a multi-core architecture
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Lower bounds for randomized read/write stream algorithms
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Machine models and lower bounds for query processing
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
I/O-conscious data preparation for large-scale web search engines
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Out-of-core and compressed level set methods
ACM Transactions on Graphics (TOG)
Large data methods for multimedia
Proceedings of the 15th international conference on Multimedia
Random-Accessible Compressed Triangle Meshes
IEEE Transactions on Visualization and Computer Graphics
Fast blocking of undesirable web pages on client PC by discriminating URL using neural networks
Expert Systems with Applications: An International Journal
OLAP over imprecise data with domain constraints
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Link analysis for Web spam detection
ACM Transactions on the Web (TWEB)
Solving Rubik's Cube: disk is the new RAM
Communications of the ACM - The psychology of security: why do good users make bad decisions?
TerraStream: from elevation data to watershed hierarchies
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
Efficient sampling of random permutations
Journal of Discrete Algorithms
The SBC-tree: an index for run-length compressed sequences
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
I/O-efficient algorithms for computing planar geometric spanners
Computational Geometry: Theory and Applications
Efficient gather and scatter operations on graphics processors
Proceedings of the 2007 ACM/IEEE conference on Supercomputing
Visions for application development on hybrid computing systems
Parallel Computing
Terracost: Computing least-cost-path surfaces for massive grid terrains
Journal of Experimental Algorithmics (JEA)
I/o-efficient efficient algorithms for computing contours on a terrain
Proceedings of the twenty-fourth annual symposium on Computational geometry
Tight competitive ratios for parallel disk prefetching and caching
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Theoretical Computer Science
On the limits of cache-oblivious rational permutations
Theoretical Computer Science
Massive model visualization techniques: course notes
ACM SIGGRAPH 2008 classes
Efficient semi-streaming algorithms for local triangle counting in massive graphs
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
External Memory Algorithms for String Problems
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
A scalable parallel framework for analyzing terascale molecular dynamics simulation trajectories
Proceedings of the 2008 ACM/IEEE conference on Supercomputing
Parallel external sort of floating-point data by integer conversion
ACC'08 Proceedings of the WSEAS International Conference on Applied Computing Conference
I/O Efficient Dynamic Data Structures for Longest Prefix Queries
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
On Trade-Offs in External-Memory Diameter-Approximation
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
A Bridging Model for Multi-core Computing
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Cache-Oblivious Red-Blue Line Segment Intersection
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
New results for finding common neighborhoods in massive graphs in the data stream model
Theoretical Computer Science
The VLDB Journal — The International Journal on Very Large Data Bases
Online maintenance of very large random samples on flash storage
Proceedings of the VLDB Endowment
VR-GIS: an integrated platform of VR navigation and GIS analysis for city/region simulation
VRCAI '08 Proceedings of The 7th ACM SIGGRAPH International Conference on Virtual-Reality Continuum and Its Applications in Industry
Incremental analysis of large VLSI Layouts
Integration, the VLSI Journal
External memory layout vs. schematic
ACM Transactions on Design Automation of Electronic Systems (TODAES)
A sweep-line algorithm for spatial clustering
Advances in Engineering Software
Lower bounds for processing data with few random accesses to external memory
Journal of the ACM (JACM)
B-tries for disk-based string management
The VLDB Journal — The International Journal on Very Large Data Bases
IRLbot: Scaling to 6 billion pages and beyond
ACM Transactions on the Web (TWEB)
Cache-oblivious range reporting with optimal queries requires superlinear space
Proceedings of the twenty-fifth annual symposium on Computational geometry
The Journal of Supercomputing
Worst-case efficient range search indexing: invited tutorial
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Hybrid and custom data structures: evolution of the data structures course
ITiCSE '09 Proceedings of the 14th annual ACM SIGCSE conference on Innovation and technology in computer science education
Recent Advances in Worst-Case Efficient Range Search Indexing
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Small stretch (α,β)-spanners in the streaming model
Theoretical Computer Science
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
k2-Trees for Compact Web Graph Representation
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
On Index-Free Similarity Search in Metric Spaces
DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
FAST: Flash-aware external sorting for mobile database systems
Journal of Systems and Software
Trading off space for passes in graph streaming problems
ACM Transactions on Algorithms (TALG)
Sorting on architecturally diverse computer systems
Proceedings of the Third International Workshop on High-Performance Reconfigurable Computing Technology and Applications
I/O-Efficient Contour Tree Simplification
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
External-memory depth-first search algorithm for solid grid graphs
Information Processing Letters
Online maintenance of very large random samples on flash storage
The VLDB Journal — The International Journal on Very Large Data Bases
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Approximation of a retrieval problem for parallel disks
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
I/O efficient accepting cycle detection
CAV'07 Proceedings of the 19th international conference on Computer aided verification
On the limits of cache-oblivious matrix transposition
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
Small stretch spanners in the streaming model: new algorithms and experiments
ESA'07 Proceedings of the 15th annual European conference on Algorithms
External memory range reporting on a grid
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Approximate range searching in external memory
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Construction of tree-based indexes for level-contiguous buffering support
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Revisiting resistance speeds up I/O-efficient LTL model checking
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
I/O-efficient point location in a set of rectangles
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Efficient processing of 3-sided range queries with probabilistic guarantees
Proceedings of the 13th International Conference on Database Theory
Cache-oblivious ray reordering
ACM Transactions on Graphics (TOG)
Machine models for query processing
ACM SIGMOD Record
Efficient algorithms for large-scale local triangle counting
ACM Transactions on Knowledge Discovery from Data (TKDD)
Fast sorting on flash memory sensor nodes
Proceedings of the Fourteenth International Database Engineering & Applications Symposium
I/O-efficient batched union-find and its applications to terrain analysis
ACM Transactions on Algorithms (TALG)
ISB-tree: A new indexing scheme with efficient expected behaviour
Journal of Discrete Algorithms
Data structures: time, I/Os, entropy, joules!
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Database theory: query languages
Algorithms and theory of computation handbook
External-memory algorithms and data structures
Algorithms and theory of computation handbook
Computing graph spanners in small memory: fault-tolerance and streaming
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Flash memory efficient LTL model checking
Science of Computer Programming
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
An efficient strategy for storing and searching binary trees in WORM external memory
Journal of Information Science
Data management for SSDs for large-scale interactive graphics applications
I3D '11 Symposium on Interactive 3D Graphics and Games
Interactive editing of massive imagery made simple: Turning Atlanta into Atlantis
ACM Transactions on Graphics (TOG)
Cultural Heritage: Out-of-core selection and editing of huge point clouds
Computers and Graphics
Should we worry about memory loss?
ACM SIGMETRICS Performance Evaluation Review - Special issue on the 1st international workshop on performance modeling, benchmarking and simulation of high performance computing systems (PMBS 10)
Sublinear algorithms in the external memory model
Property testing
Sublinear algorithms in the external memory model
Property testing
Computing strongly connected components in the streaming model
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Pseudo-random graphs and bit probe schemes with one-sided error
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
NEFOS: rapid cache-aware range query processing with probabilistic guarantees
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I
External-memory network analysis algorithms for naturally sparse graphs
ESA'11 Proceedings of the 19th European conference on Algorithms
Clustering nodes in large-scale biological networks using external memory algorithms
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part II
External string sorting: faster and cache-oblivious
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
I/O-Efficiently pruning dense spanners
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
Data streams and data synopses for massive data sets
PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases
SLIM: Mmap from the cloud to device, and back
Proceedings of the Second Asia-Pacific Workshop on Systems
Cache-aware and cache-oblivious adaptive sorting
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Tight lower bounds for query processing on streaming and external memory data
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Oblivious vs. distribution-based sorting: an experimental evaluation
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Out-of-Core Computations of High-Resolution Level Sets by Means of Code Transformation
Journal of Scientific Computing
ISB-tree: a new indexing scheme with efficient expected behaviour
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Data streams and data synopses for massive data sets
ECML'05 Proceedings of the 16th European conference on Machine Learning
How to pack directed acyclic graphs into small blocks
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Networks beat pipelines: the design of FG 2.0
Proceedings of the 2012 International Workshop on Programming Models and Applications for Multicores and Manycores
The complexity of querying external memory and streaming data
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Generating raster DEM from mass points via TIN streaming
GIScience'06 Proceedings of the 4th international conference on Geographic Information Science
Rank-Sensitive data structures
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
An external-memory retrograde analysis algorithm
CG'04 Proceedings of the 4th international conference on Computers and Games
External memory orthogonal range reporting with fast updates
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
External Memory Algorithms for String Problems
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
Knowledge-based out-of-core algorithms for data management in visualization
EUROVIS'06 Proceedings of the Eighth Joint Eurographics / IEEE VGTC conference on Visualization
Cache-oblivious index for approximate string matching
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Simplifying massive contour maps
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
An efficient programming model for memory-intensive recursive algorithms using parallel disks
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
I/O efficient: computing SCCs in massive graphs
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
On the weak prefix-search problem
Theoretical Computer Science
Computing weight constraint reachability in large networks
The VLDB Journal — The International Journal on Very Large Data Bases
GPU-based out-of-core many-lights rendering
ACM Transactions on Graphics (TOG)
Permuting data on random-access block storage
Proceedings of the VLDB Endowment
Compact representation of Web graphs with extended functionality
Information Systems
Hi-index | 0.01 |
Data sets in large applications are often too massive to fit completely inside the computers internal memory. The resulting input/output communication (or I/O) between fast internal memory and slower external memory (such as disks) can be a major performance bottleneck. In this article we survey the state of the art in the design and analysis of external memory (or EM) algorithms and data structures, where the goal is to exploit locality in order to reduce the I/O costs. We consider a variety of EM paradigms for solving batched and online problems efficiently in external memory. For the batched problem of sorting and related problems such as permuting and fast Fourier transform, the key paradigms include distribution and merging. The paradigm of disk striping offers an elegant way to use multiple disks in parallel. For sorting, however, disk striping can be nonoptimal with respect to I/O, so to gain further improvements we discuss distribution and merging techniques for using the disks independently. We also consider useful techniques for batched EM problems involving matrices (such as matrix multiplication and transposition), geometric data (such as finding intersections and constructing convex hulls), and graphs (such as list ranking, connected components, topological sorting, and shortest paths). In the online domain, canonical EM applications include dictionary lookup and range searching. The two important classes of indexed data structures are based upon extendible hashing and B-trees. The paradigms of filtering and bootstrapping provide a convenient means in online data structures to make effective use of the data accessed from disk. We also reexamine some of the above EM problems in slightly different settings, such as when the data items are moving, when the data items are variable-length (e.g., text strings), or when the allocated amount of internal memory can change dynamically. Programming tools and environments are available for simplifying the EM programming task. During the course of the survey, we report on some experiments in the domain of spatial databases using the TPIE system (transparent parallel I/O programming environment). The newly developed EM algorithms and data structures that incorporate the paradigms we discuss are significantly faster than methods currently used in practice.