The paper studies the problem of maintaining external dynamic dictionaries with variable length keys. We introduce a new type of balanced trees, called S(b)-trees, which generaliz...
A new Blink Tree latching method and protocol simplifies implementation of Lehman and Yao's high
concurrency Blink Tree with Jaluta's balanced Blink Tree methods with in...
A new method for updating certificate revocation trees (CRT) is proposed. Efficient revocation of publickey certificates is a current issue in public-key Infrastructure because a ...
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
Marketing research has longed for better ways to measure consumer behavior. In this paper, we explore using sociometric data to study social behaviors of group shoppers. We hypoth...
James Begole, Maurice Chu, Oliver Brdiczka, Taemie...