Checking Value-Sensitive Data Structures in Sublinear Space

Checking value-sensitive data structures in sublinear space has been an open problem for over a decade. In this paper, we suggest a novel approach to solving it. We show that, in combination with other techniques, a previous method for checking value-insensitive data structures in log space can be extended for checking the more complicated value-sensitive data structures, using log space as well. We present the theoretical model of checking data structures and discuss the types of invasions a checker might bring to the data structure server. We also provide our idea of designing sublinear space checkers for value-sensitive data structures and give a concrete example – a log space checker for the search data structures (SDS).

• Type: Conference
• Year: 2007
• Where: ISAAC
• Authors: Michael T. Goodrich, Jonathan Z. Sun
• Keywords: Data Structures, ISAAC 2007, Log Space, Value-sensitive Data Structures