Sciweavers

281 search results - page 45 / 57
» Balancing weight-balanced trees
Sort
View
ERLANG
2003
ACM
14 years 19 days ago
A study of Erlang ETS table implementations and performance
The viability of implementing an in-memory database, Erlang ETS, using a relatively-new data structure, called a Judy array, was studied by comparing the performance of ETS tables...
Scott Lystig Fritchie
COMPGEOM
2010
ACM
14 years 14 days ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park

Book
411views
15 years 5 months ago
Concrete Abstractions
"This book has evolved from materials used in an undergraduate course intended for final year undergraduate students whose background includes at least one year's experie...
Max Hailperin, Barbara Kaiser, and Karl Knight
CHI
2009
ACM
14 years 8 months ago
Predicting shoppers' interest from social interactions using sociometric sensors
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...
ICDE
2010
IEEE
262views Database» more  ICDE 2010»
14 years 7 months ago
Approximate String Search in Spatial Databases
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
Bin Yao, Feifei Li, Marios Hadjieleftheriou, Kun H...