Sciweavers

55 search results - page 9 / 11
» Cost models for distance joins queries using R-trees
Sort
View
PVLDB
2008
154views more  PVLDB 2008»
13 years 7 months ago
Indexing land surface for efficient kNN query
The class of k Nearest Neighbor (kNN) queries is frequently used in geospatial applications. Many studies focus on processing kNN in Euclidean and road network spaces. Meanwhile, ...
Cyrus Shahabi, Lu-An Tang, Songhua Xing
VLDB
2001
ACM
190views Database» more  VLDB 2001»
14 years 19 hour ago
LEO - DB2's LEarning Optimizer
Most modern DBMS optimizers rely upon a cost model to choose the best query execution plan (QEP) for any given query. Cost estimates are heavily dependent upon the optimizer’s e...
Michael Stillger, Guy M. Lohman, Volker Markl, Mok...
ICDE
2008
IEEE
162views Database» more  ICDE 2008»
14 years 9 months ago
Querying Complex Spatio-Temporal Sequences in Human Motion Databases
Content-based retrieval of spatio-temporal patterns from human motion databases is inherently nontrivial since finding effective distance measures for such data is difficult. These...
Yueguo Chen, Shouxu Jiang, Beng Chin Ooi, Anthony ...
HICSS
1996
IEEE
74views Biometrics» more  HICSS 1996»
13 years 11 months ago
Querying Structured Hyperdocuments
In this paper, we present a document model which integrates the logical structure and hypertext link structure of hyperdocuments in order to manage structured documents with hyper...
Yong Kyu Lee, Seong-Joon Yoo, Kyoungro Yoon, P. Br...
EDBT
2009
ACM
173views Database» more  EDBT 2009»
14 years 6 days ago
PROUD: a probabilistic approach to processing similarity queries over uncertain data streams
We present PROUD - A PRObabilistic approach to processing similarity queries over Uncertain Data streams, where the data streams here are mainly time series streams. In contrast t...
Mi-Yen Yeh, Kun-Lung Wu, Philip S. Yu, Ming-Syan C...