Sciweavers

1890 search results - page 113 / 378
» Querying Big Data by Accessing Small Data
Sort
View
DPD
2006
141views more  DPD 2006»
15 years 6 months ago
Efficient parallel processing of range queries through replicated declustering
A common technique used to minimize I/O in data intensive applications is data declustering over parallel servers. This technique involves distributing data among several disks so...
Hakan Ferhatosmanoglu, Ali Saman Tosun, Guadalupe ...
HCI
2009
15 years 4 months ago
Enabling Interactive Access to Web Tables
Tables are widely used in web pages. Unfortunately, most web tables can only be passively accessed but cannot be interactively accessed, that is, users can view information display...
Xin Yang, Wenchang Xu, Yuanchun Shi
VLDB
2005
ACM
85views Database» more  VLDB 2005»
15 years 12 months ago
A Faceted Query Engine Applied to Archaeology
In this demonstration, we describe a system for storing and querying faceted hierarchies. We have developed a general faceted domain model and a query language for hierarchically ...
Kenneth A. Ross, Angel Janevski, Julia Stoyanovich
SACMAT
2011
ACM
14 years 9 months ago
Modeling data flow in socio-information networks: a risk estimation approach
Information leakage via the networks formed by subjects (e.g., Facebook, Twitter) and objects (e.g., blogosphere) − some of whom may be controlled by malicious insiders − ofte...
Ting Wang, Mudhakar Srivatsa, Dakshi Agrawal, Ling...
BNCOD
2004
184views Database» more  BNCOD 2004»
15 years 7 months ago
Bulk Loading the M-Tree to Enhance Query Performance
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. Like many spatial access methods, the M-tree's perfo...
Alan P. Sexton, Richard Swinbank