Sciweavers

5128 search results - page 693 / 1026
» An Efficient Storage Manager
Sort
View
SSDBM
2002
IEEE
149views Database» more  SSDBM 2002»
15 years 11 months ago
A Cost Model for Interval Intersection Queries on RI-Trees
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
216
Voted
IWMM
1998
Springer
153views Hardware» more  IWMM 1998»
15 years 11 months ago
Compiler Support to Customize the Mark and Sweep Algorithm
Mark and sweep garbage collectors (GC) are classical but still very efficient automatic memory management systems. Although challenged by other kinds of systems, such as copying c...
Dominique Colnet, Philippe Coucaud, Olivier Zendra
SIGCOMM
1996
ACM
15 years 11 months ago
Start-Time Fair Queueing: A Scheduling Algorithm for Integrated Services Packet Switching Networks
Abstract-- We present a Start-time Fair Queueing (SFQ) algorithm that is computationally efficient and achieves fairness regardless of variation in a server capacity. We analyze it...
Pawan Goyal, Harrick M. Vin, Haichen Cheng
203
Voted
CCGRID
2004
IEEE
15 years 10 months ago
Cache replacement policies revisited: the case of P2P traffic
Peer-to-peer (P2P) file-sharing applications generate a large part if not most of today's Internet traffic. The large volume of this traffic (thus the high potential benefits...
Adam Wierzbicki, Nathaniel Leibowitz, Matei Ripean...
DASFAA
2004
IEEE
158views Database» more  DASFAA 2004»
15 years 10 months ago
A Cost Model for Spatial Intersection Queries on RI-Trees
Abstract. The efficient management of interval sequences represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tr...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...