I/O-efficient data structures for non-overlapping indexing

2020 ◽  
Author(s):  
Sahar Hooshmand ◽  
Paniz Abedin ◽  
M. Oğuzhan Külekci ◽  
Sharma V. Thankachan
Keyword(s):  
Data Structures ◽  
Efficient Data ◽  
Efficient Data Structures

Efficient Data Structures for Range Selections Problem

2013 ◽  
Vol 756-759 ◽  
pp. 1387-1391
Author(s):  
Xiao Dong Wang ◽  
Jun Tian
Keyword(s):  
Data Structure ◽  
Linear Space ◽  
Data Structures ◽  
Computation Model ◽  
Word Size ◽  
Selection Problems ◽  
Efficient Data ◽  
Space Data ◽  
Efficient Data Structures ◽  
Range Selection

Building an efficient data structure for range selection problems is considered. While there are several theoretical solutions to the problem, only a few have been tried out, and there is little idea on how the others would perform. The computation model used in this paper is the RAM model with word-size . Our data structure is a practical linear space data structure that supports range selection queries in time with preprocessing time.

Scalable plasma simulation with ELMFIRE using efficient data structures for process communication

2008 ◽  
Vol 179 (5) ◽  
pp. 330-338
Author(s):  
Artur Signell ◽  
Francisco Ogando ◽  
Mats Aspnäs ◽  
Jan Westerholm
Keyword(s):  
Data Structures ◽  
Plasma Simulation ◽  
Process Communication ◽  
Efficient Data ◽  
Efficient Data Structures

Memory Efficient Data Structures for Explicit Verification of Timed Systems

2014 ◽  
pp. 307-312 ◽  
Author(s):  
Peter Gjøl Jensen ◽  
Kim Guldstrand Larsen ◽  
Jiří Srba ◽  
Mathias Grund Sørensen ◽  
Jakob Haar Taankvist
Keyword(s):  
Data Structures ◽  
Timed Systems ◽  
Efficient Data ◽  
Efficient Data Structures ◽  
Memory Efficient
Sign in / Sign up

Export Citation Format

Share Document