Sciweavers

6905 search results - page 22 / 1381
» Querying Multidimensional Databases
Sort
View
WAIM
2007
Springer
14 years 4 months ago
An Efficient Spatial Search Method Based on SG-Tree
To solve the overlapping search of multidimensional spatial database containing large quantity of objects with dynamic spatial extent, this paper proposes an index structure named ...
Yintian Liu, Changjie Tang, Lei Duan, Tao Zeng, Ch...
ICDE
2004
IEEE
259views Database» more  ICDE 2004»
14 years 11 months ago
Querying about the Past, the Present, and the Future in Spatio-Temporal
Moving objects (e.g., vehicles in road networks) continuously generate large amounts of spatio-temporal information in the form of data streams. Efficient management of such strea...
Jimeng Sun, Dimitris Papadias, Yufei Tao, Bin Liu
CORR
2011
Springer
175views Education» more  CORR 2011»
13 years 4 months ago
A Novel Probabilistic Pruning Approach to Speed Up Similarity Queries in Uncertain Databases
Abstract— In this paper, we propose a novel, effective and efficient probabilistic pruning criterion for probabilistic similarity queries on uncertain data. Our approach support...
Thomas Bernecker, Tobias Emrich, Hans-Peter Kriege...
KES
2004
Springer
14 years 3 months ago
Multidimensional Visualization and Navigation in Search Results
Abstract. Search engines traditionally index unstructured text and return ranked lists of documents that match a given query. As search engines functionally move in the direction o...
Will Archer Arentz, Aleksander Øhrn
ICDE
1987
IEEE
81views Database» more  ICDE 1987»
14 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