Sciweavers

1890 search results - page 32 / 378
» Querying Big Data by Accessing Small Data
Sort
View
SBACPAD
2004
IEEE
144views Hardware» more  SBACPAD 2004»
15 years 7 months ago
Improving Server Performance on Transaction Processing Workloads by Enhanced Data Placement
Modern servers access large volumes of data while running commercial workloads. The data is typically spread among several storage devices (e.g. disks). Carefully placing the data...
Juan Rubio, Charles Lefurgy, Lizy Kurian John
CSREAEEE
2006
120views Business» more  CSREAEEE 2006»
15 years 7 months ago
Object Caching Model for Cell Phone Mobile Database
- Inherent limitations of mobile computing environment such as limited bandwidth, limited resourced mobile phones, and instability of wireless environment require summarized mobile...
Khubaib Ahmed Qureshi
SIGMOD
2009
ACM
157views Database» more  SIGMOD 2009»
16 years 6 months ago
Asynchronous view maintenance for VLSD databases
The query models of the recent generation of very large scale distributed (VLSD) shared-nothing data storage systems, including our own PNUTS and others (e.g. BigTable, Dynamo, Ca...
Parag Agrawal, Adam Silberstein, Brian F. Cooper, ...
ICDE
2011
IEEE
233views Database» more  ICDE 2011»
14 years 10 months ago
Answering approximate string queries on large data sets using external memory
— An approximate string query is to find from a collection of strings those that are similar to a given query string. Answering such queries is important in many applications su...
Alexander Behm, Chen Li, Michael J. Carey
CIKM
2001
Springer
15 years 10 months ago
Joint Optimization of Cost and Coverage of Query Plans in Data Integration
Existing approaches for optimizing queries in data integration use decoupled strategies–attempting to optimize coverage and cost in two separate phases. Since sources tend to ha...
Zaiqing Nie, Subbarao Kambhampati