Sciweavers

1890 search results - page 100 / 378
» Querying Big Data by Accessing Small Data
Sort
View
SIGMOD
2007
ACM
91views Database» more  SIGMOD 2007»
16 years 6 months ago
Indexing dataspaces
Dataspaces are collections of heterogeneous and partially unstructured data. Unlike data-integration systems that also offer uniform access to heterogeneous data sources, dataspac...
Xin Dong, Alon Y. Halevy
VLDB
2004
ACM
134views Database» more  VLDB 2004»
15 years 11 months ago
A Privacy-Preserving Index for Range Queries
Database outsourcing is an emerging data management paradigm which has the potential to transform the IT operations of corporations. In this paper we address privacy threats in da...
Bijit Hore, Sharad Mehrotra, Gene Tsudik
VLDB
2001
ACM
82views Database» more  VLDB 2001»
15 years 10 months ago
Supporting Incremental Join Queries on Ranked Inputs
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...
Apostol Natsev, Yuan-Chi Chang, John R. Smith, Chu...
PODS
2005
ACM
164views Database» more  PODS 2005»
16 years 6 months ago
Lower bounds for sorting with few random accesses to external memory
We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situati...
Martin Grohe, Nicole Schweikardt
CLUSTER
2006
IEEE
16 years 13 days ago
An Iteration Aware Multidimensional Data Distribution Prototype for Computing Clusters
Disk and network latency must be taken into account when applying parallel computing to large multidimensional datasets because they can hinder performance by reducing the rate at...
Baoqiang Yan, Philip J. Rhodes