Sciweavers

1053 search results - page 125 / 211
» Shape as Memory Storage
Sort
View
INFOCOM
2005
IEEE
15 years 3 months ago
TCAM-based distributed parallel packet classification algorithm with range-matching solution
Packet Classification (PC) has been a critical data path function for many emerging networking applications. An interesting approach is the use of TCAM to achieve deterministic, hi...
Kai Zheng, Hao Che, Zhijun Wang, Bin Liu
VLDB
2005
ACM
122views Database» more  VLDB 2005»
15 years 3 months ago
C-Store: A Column-oriented DBMS
This paper presents the design of a read-optimized relational DBMS that contrasts sharply with most current systems, which are write-optimized. Among the many differences in its d...
Michael Stonebraker, Daniel J. Abadi, Adam Batkin,...
IWMM
2004
Springer
82views Hardware» more  IWMM 2004»
15 years 3 months ago
Write barrier elision for concurrent garbage collectors
Concurrent garbage collectors require write barriers to preserve consistency, but these barriers impose significant direct and indirect costs. While there has been a lot of work ...
Martin T. Vechev, David F. Bacon
VLDB
2001
ACM
121views Database» more  VLDB 2001»
15 years 2 months ago
Weaving Relations for Cache Performance
Relational database systems have traditionally optimzed for I/O performance and organized records sequentially on disk pages using the N-ary Storage Model (NSM) (a.k.a., slotted p...
Anastassia Ailamaki, David J. DeWitt, Mark D. Hill...
POS
1998
Springer
15 years 2 months ago
Optimizing the Read and Write Barriers for Orthogonal Persistence
Persistent programming languages manage volatile memory as a cache for stable storage, imposing a read barrier on operations that access the cache, and a write barrier on updates ...
Antony L. Hosking, Nathaniel Nystrom, Quintin I. C...