Sciweavers

61 search results - page 12 / 13
» Synchronizing a Database to Improve Freshness
Sort
View
VLDB
1997
ACM
134views Database» more  VLDB 1997»
13 years 9 months ago
Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations
R-tree based spatial join is useful because of both its superior performance and the wide spread implementation of R-trees. We present a new R-tree join method called BFRJ (Breadt...
Yun-Wu Huang, Ning Jing, Elke A. Rundensteiner
HOTOS
2007
IEEE
13 years 9 months ago
HotComments: How to Make Program Comments More Useful?
Program comments have long been used as a common practice for improving inter-programmer communication and code readability, by explicitly specifying programmers' intentions ...
Lin Tan, Ding Yuan, Yuanyuan Zhou
MST
2002
128views more  MST 2002»
13 years 4 months ago
A Simple and Efficient Parallel Disk Mergesort
External sorting--the process of sorting a file that is too large to fit into the computer's internal memory and must be stored externally on disks--is a fundamental subroutin...
Rakesh D. Barve, Jeffrey Scott Vitter
PPOPP
2010
ACM
14 years 2 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...
ASPLOS
2000
ACM
13 years 9 months ago
Hoard: A Scalable Memory Allocator for Multithreaded Applications
Parallel, multithreaded C and C++ programs such as web servers, database managers, news servers, and scientific applications are becoming increasingly prevalent. For these applic...
Emery D. Berger, Kathryn S. McKinley, Robert D. Bl...