Sciweavers

1890 search results - page 84 / 378
» Querying Big Data by Accessing Small Data
Sort
View
DEXA
2004
Springer
103views Database» more  DEXA 2004»
15 years 4 months ago
Characterizing Database User's Access Patterns
Much work has been done on characterizing the workload of a database system. Previous studies focused on providing different types of statistical summaries, and modeling the run-ti...
Qingsong Yao, Aijun An
94
Voted
PODS
2006
ACM
95views Database» more  PODS 2006»
15 years 11 months ago
Randomized computations on large data sets: tight lower bounds
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
André Hernich, Martin Grohe, Nicole Schweik...
HPDC
2010
IEEE
15 years 6 days ago
ROARS: a scalable repository for data intensive scientific computing
As scientific research becomes more data intensive, there is an increasing need for scalable, reliable, and high performance storage systems. Such data repositories must provide b...
Hoang Bui, Peter Bui, Patrick J. Flynn, Douglas Th...
101
Voted
DBSEC
2008
196views Database» more  DBSEC 2008»
15 years 17 days ago
Shared and Searchable Encrypted Data for Untrusted Servers
Current security mechanisms are not suitable for organisations that outsource their data management to untrusted servers. Encrypting and decrypting sensitive data at the client si...
Changyu Dong, Giovanni Russello, Naranker Dulay
EDBT
2009
ACM
132views Database» more  EDBT 2009»
15 years 6 months ago
A novel approach for efficient supergraph query processing on graph databases
In recent years, large amount of data modeled by graphs, namely graph data, have been collected in various domains. Efficiently processing queries on graph databases has attracted...
Shuo Zhang, Jianzhong Li, Hong Gao, Zhaonian Zou