Sciweavers

1031 search results - page 99 / 207
» Managing the operator ordering problem in parallel databases
Sort
View
140
Voted
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
16 years 3 months ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang
126
Voted
SAC
2005
ACM
15 years 9 months ago
Automatic wrapper maintenance for semi-structured web sources using results from previous queries
During the last years, significant attention has been paid to the problem of building wrappers for extracting data from semistructured web sources. Nevertheless, since web sources...
Juan Raposo, Alberto Pan, Manuel Álvarez, &...
120
Voted
COORDINATION
2005
Springer
15 years 9 months ago
Preserving Architectural Properties in Multithreaded Code Generation
Architectural descriptions can provide support for a formal representation of the structure and the overall behavior of software systems, which is suitable for an early assessment ...
Marco Bernardo, Edoardo Bontà
GIS
2003
ACM
16 years 4 months ago
Computational data modeling for network-constrained moving objects
Advances in wireless communications, positioning technology, and other hardware technologies combine to enable a range of applications that use a mobile user's geo-spatial da...
Laurynas Speicys, Christian S. Jensen, Augustas Kl...
129
Voted
USENIX
2008
15 years 5 months ago
Prefetching with Adaptive Cache Culling for Striped Disk Arrays
Conventional prefetching schemes regard prediction accuracy as important because useless data prefetched by a faulty prediction may pollute the cache. If prefetching requires cons...
Sung Hoon Baek, Kyu Ho Park