Sciweavers

643 search results - page 68 / 129
» Dynamic prioritization of database queries
Sort
View
SIGMOD
1999
ACM
127views Database» more  SIGMOD 1999»
15 years 2 months ago
An Adaptive Query Execution System for Data Integration
Query processing in data integration occurs over network-bound, autonomous data sources. This requires extensions to traditional optimization and execution techniques for three re...
Zachary G. Ives, Daniela Florescu, Marc Friedman, ...
MEDINFO
2007
116views Healthcare» more  MEDINFO 2007»
14 years 11 months ago
Knowledge-Level Querying of Temporal Patterns in Clinical Research Systems
Managing time-stamped data is essential to clinical research activities and often requires the use of considerable domain knowledge, which is difficult to support within database ...
Martin J. O'Connor, Ravi D. Shankar, David B. Parr...
ICDE
1987
IEEE
81views Database» more  ICDE 1987»
15 years 1 months ago
Multidimensional Dynamic Quantile Hashing is Very Efficient for Non-Uniform Record Distributions
: Previous multidimensional dynamic hashing schemes exhibit two obvious shortcomings. First, even for uniform record distribution, the retrieval performance of these schemes suffer...
Hans-Peter Kriegel, Bernhard Seeger
VLDB
2008
ACM
147views Database» more  VLDB 2008»
15 years 10 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
GIS
2005
ACM
15 years 10 months ago
Adaptive nearest neighbor queries in travel time networks
Nearest neighbor (NN) searches represent an important class of queries in geographic information systems (GIS). Most nearest neighbor algorithms rely on static distance informatio...
Wei-Shinn Ku, Roger Zimmermann, Haojun Wang, Chi-N...