Sciweavers

4536 search results - page 359 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
ICNP
2009
IEEE
16 years 1 months ago
Scalable IP Lookups using Shape Graphs
—Recently, there has been much renewed interest in developing compact data structures for packet processing functions such as longest prefix-match for IP lookups. This has been ...
Haoyu Song, Murali S. Kodialam, Fang Hao, T. V. La...
ICDE
2008
IEEE
195views Database» more  ICDE 2008»
16 years 8 months ago
LOCUST: An Online Analytical Processing Framework for High Dimensional Classification of Data Streams
Abstract-- In recent years, data streams have become ubiquitous because of advances in hardware and software technology. The ability to adapt conventional mining problems to data s...
Charu C. Aggarwal, Philip S. Yu
195
Voted
DKE
2006
125views more  DKE 2006»
15 years 6 months ago
Online clustering of parallel data streams
In recent years, the management and processing of so-called data streams has become a topic of active research in several fields of computer science such as, e.g., distributed sys...
Jürgen Beringer, Eyke Hüllermeier
VLDB
1995
ACM
89views Database» more  VLDB 1995»
15 years 10 months ago
OODB Bulk Loading Revisited: The Partitioned-List Approach
Object-oriented and object-relational databases(OODB) need to be able to load the vast quantities of data that OODB users bring to them. Loading OODB datais significantly more com...
Janet L. Wiener, Jeffrey F. Naughton
DAM
2007
105views more  DAM 2007»
15 years 6 months ago
Recognizing and representing proper interval graphs in parallel using merging and sorting
We present a parallel algorithm for recognizing and representing a proper interval graph in O(log2 n) time with O(m + n) processors on the CREW PRAM, where m and n are the number ...
Jørgen Bang-Jensen, Jing Huang, Louis Ibarr...