Sciweavers

589 search results - page 34 / 118
» Location-dependent query processing: Where we are and where ...
Sort
View
ALT
2004
Springer
14 years 4 months ago
New Revision Algorithms
A revision algorithm is a learning algorithm that identifies the target concept, starting from an initial concept. Such an algorithm is considered efficient if its complexity (in ...
Judy Goldsmith, Robert H. Sloan, Balázs Sz&...
FAST
2011
12 years 11 months ago
A Scheduling Framework That Makes Any Disk Schedulers Non-Work-Conserving Solely Based on Request Characteristics
Exploiting spatial locality is critical for a disk scheduler to achieve high throughput. Because of the high cost of disk head seeks and the non-preemptible nature of request serv...
Yuehai Xu, Song Jiang
VLDB
2007
ACM
169views Database» more  VLDB 2007»
14 years 7 months ago
Peer-to-Peer Similarity Search in Metric Spaces
This paper addresses the efficient processing of similarity queries in metric spaces, where data is horizontally distributed across a P2P network. The proposed approach does not r...
Christos Doulkeridis, Akrivi Vlachou, Yannis Kotid...
SIGMOD
2007
ACM
147views Database» more  SIGMOD 2007»
14 years 7 months ago
Extending relational query optimization to dynamic schemas for information integration in multidatabases
This paper extends relational processing and optimization to the FISQL/FIRA languages for dynamic schema queries over multidatabases. Dynamic schema queries involve the creation a...
Catharine M. Wyss, Felix I. Wyss
ICDE
2008
IEEE
127views Database» more  ICDE 2008»
14 years 9 months ago
Querying Data under Access Limitations
Data sources on the web are often accessible through web interfaces that present them as relational tables, but require certain attributes to be mandatorily selected, e.g., via a w...
Andrea Calì, Davide Martinenghi