Sciweavers

931 search results - page 66 / 187
» Storage and Querying of E-Commerce Data
Sort
View
VLDB
2005
ACM
117views Database» more  VLDB 2005»
14 years 2 months ago
Parallel Querying with Non-Dedicated Computers
We present DITN, a new method of parallel querying based on dynamic outsourcing of join processing tasks to non-dedicated, heterogeneous computers. In DITN, partitioning is not th...
Vijayshankar Raman, Wei Han, Inderpal Narang
COMPGEOM
2005
ACM
13 years 11 months ago
The skip quadtree: a simple dynamic data structure for multidimensional data
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
David Eppstein, Michael T. Goodrich, Jonathan Z. S...
WWW
2006
ACM
14 years 9 months ago
Semantic link based top-K join queries in P2P networks
An important issue arising from Peer-to-Peer applications is how to accurately and efficiently retrieve a set of K best matching data objects from different sources while minimizi...
Jie Liu, Liang Feng, Chao He
BTW
2007
Springer
185views Database» more  BTW 2007»
14 years 3 months ago
Data Staging for OLAP- and OLTP-Applications on RFID Data
: The emerging trend towards seamless monitoring of all business processes via comprehensive sensor networks – in particular RFID readers – creates new data management challeng...
Stefan Krompass, Stefan Aulbach, Alfons Kemper
ICDE
2010
IEEE
235views Database» more  ICDE 2010»
14 years 8 months ago
Cost-efficient and Differentiated Data Availability Guarantees in Data Clouds
Abstract-- Failures of any type are common in current datacenters. As data scales up, its availability becomes more complex, while different availability levels per application or ...
Nicolas Bonvin, Thanasis G. Papaioannou, Karl Aber...