In-memory processing of big data via succinct data structures
In-memory hash tables for accumulating text vocabularies
in-memory data structure for google datastore on multi
In-Memory Columnstore Indexes-
In olden times, pre–relational database, database systems were
In Microsoft Word () format - Web-CAT
Improving the Performance of Region Quadtrees
Improving the Performance of Data Cube Queries Using Families of
Improving the efficiency of priority-queue structures
Improving Lookup Time Complexity of Compressed Suffix Arrays
Improving I/O Performance using Virtual Disk
improvements in double ended priority queues
Improved Symmetric Lists
Improved Bounds for Orthogonal Point Enclosure Query and Point
Implicit Data Structures, Sorting, and Text Indexing
Implementing Union-Find Algorithm with Base SAS DATA Steps and Macro Functions
Implementing Persistent O(1) Stacks and Queues in R
Implementing Database Operations Using SIMD
Implementing algebraically specified abstract data types in an
Implementing ADTs
