Sciweavers

2498 search results - page 161 / 500
» Data Structures with Unpredictable Timing
Sort
View
ICDE
2000
IEEE
158views Database» more  ICDE 2000»
15 years 11 months ago
Analyzing Range Queries on Spatial Data
Analysis of range queries on spatial (multidimensional) data is both important and challenging. Most previous analysis attempts have made certain simplifying assumptions about the...
Ji Jin, Ning An, Anand Sivasubramaniam
DAWAK
2001
Springer
15 years 2 months ago
Shared Index Scans for Data Warehouses
Tree based indexing structures like -trees, ·-trees, Bitmap indexes and Ê-trees have become essential for getting good performance when accessing vast datasets. However, most dat...
Yannis Kotidis, Yannis Sismanis, Nick Roussopoulos
SIAMCOMP
1998
138views more  SIAMCOMP 1998»
14 years 9 months ago
Dynamic Trees and Dynamic Point Location
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
Michael T. Goodrich, Roberto Tamassia
WWW
2007
ACM
15 years 10 months ago
A unified platform for data driven web applications with automatic client-server partitioning
Data-driven web applications are usually structured in three tiers with different programming models at each tier. This division forces developers to manually partition applicatio...
Fan Yang 0002, Nitin Gupta 0003, Nicholas Gerner, ...
CIKM
2005
Springer
15 years 3 months ago
Exact match search in sequence data using suffix trees
We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...
Mihail Halachev, Nematollaah Shiri, Anand Thamildu...