Sciweavers

39 search results - page 4 / 8
» Top-k selection queries over relational databases: Mapping s...
Sort
View
SIGMOD
2004
ACM
150views Database» more  SIGMOD 2004»
14 years 6 months ago
When one Sample is not Enough: Improving Text Database Selection Using Shrinkage
Database selection is an important step when searching over large numbers of distributed text databases. The database selection task relies on statistical summaries of the databas...
Panagiotis G. Ipeirotis, Luis Gravano
EDBT
2010
ACM
177views Database» more  EDBT 2010»
14 years 18 days ago
Bridging the gap between intensional and extensional query evaluation in probabilistic databases
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...
Abhay Jha, Dan Olteanu, Dan Suciu
SIGMOD
1996
ACM
112views Database» more  SIGMOD 1996»
13 years 10 months ago
Performance Tradeoffs for Client-Server Query Processing
The constructionof high-performance databasesystems that combine the best aspects of the relational and object-oriented approaches requires the design of client-server architectur...
Michael J. Franklin, Björn Þór J...
SSDBM
2003
IEEE
142views Database» more  SSDBM 2003»
13 years 11 months ago
A Strategy Selection Framework for Adaptive Prefetching in Data Visualization
Accessing data stored in persistent memory represents a bottleneck for current visual exploration applications. Semantic caching of frequent queries at the client-side along with ...
Punit R. Doshi, Geraldine E. Rosario, Elke A. Rund...
GIS
2007
ACM
14 years 6 months ago
Partition-based lazy updates for continuous queries over moving objects
Continuous spatial queries posted within an environment of moving objects produce as their results a time-varying set of objects. In the most ambitious case both queries and data ...
Yu-Ling Hsueh, Roger Zimmermann, Haojun Wang, Wei-...