Sciweavers

15494 search results - page 2656 / 3099
» Computing dynamic clusters
Sort
View
ICDE
2009
IEEE
177views Database» more  ICDE 2009»
16 years 8 months ago
Light-Weight, Runtime Verification of Query Sources
Modern database systems increasingly make use of networked storage. This storage can be in the form of SAN's or in the form of shared-nothing nodes in a cluster. One type of a...
Tingjian Ge, Stanley B. Zdonik
ICDE
2006
IEEE
215views Database» more  ICDE 2006»
16 years 8 months ago
cgmOLAP: Efficient Parallel Generation and Querying of Terabyte Size ROLAP Data Cubes
In this demo we present the cgmOLAP server, the first fully functional parallel OLAP system able to build data cubes at a rate of more than 1 Terabyte per hour. cgmOLAP incorporat...
Ying Chen, Andrew Rau-Chaplin, Frank K. H. A. Dehn...
GIS
2008
ACM
16 years 8 months ago
Mining user similarity based on location history
The pervasiveness of location-acquisition technologies (GPS, GSM networks, etc.) enable people to conveniently log the location histories they visited with spatio-temporal data. T...
Quannan Li, Yu Zheng, Xing Xie, Yukun Chen, Wenyu ...
GIS
2006
ACM
16 years 8 months ago
Exploiting a page-level upper bound for multi-type nearest neighbor queries
Given a query point and a collection of spatial features, a multi-type nearest neighbor (MTNN) query finds the shortest tour for the query point such that only one instance of eac...
Xiaobin Ma, Shashi Shekhar, Hui Xiong, Pusheng Zha...
DAC
2009
ACM
16 years 7 months ago
Handling complexities in modern large-scale mixed-size placement
In this paper, we propose an effective algorithm flow to handle largescale mixed-size placement. The basic idea is to use floorplanning to guide the placement of objects at the gl...
Jackey Z. Yan, Natarajan Viswanathan, Chris Chu
« Prev « First page 2656 / 3099 Last » Next »