Sciweavers

137 search results - page 18 / 28
» Efficient Processing of Top-k Spatial Preference Queries
Sort
View
SIGMOD
2007
ACM
160views Database» more  SIGMOD 2007»
14 years 6 months ago
Supporting ranking and clustering as generalized order-by and group-by
The Boolean semantics of SQL queries cannot adequately capture the "fuzzy" preferences and "soft" criteria required in non-traditional data retrieval applicati...
Chengkai Li, Min Wang, Lipyeow Lim, Haixun Wang, K...
JSS
2008
68views more  JSS 2008»
13 years 6 months ago
An efficient iconic indexing strategy for image rotation and reflection in image databases
Spatial relationships are important issues for similarity-based retrieval in many image database applications. With the popularity of digital cameras and the related image process...
Wei-Horng Yeh, Ye-In Chang
CGF
2004
113views more  CGF 2004»
13 years 6 months ago
Coherent Hierarchical Culling: Hardware Occlusion Queries Made Useful
We present a simple but powerful algorithm for optimizing the usage of hardware occlusion queries in arbitrary complex scenes. Our method minimizes the number of issued queries an...
Jirí Bittner, Michael Wimmer, Harald Piring...
SSDBM
2002
IEEE
149views Database» more  SSDBM 2002»
13 years 11 months ago
A Cost Model for Interval Intersection Queries on RI-Trees
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
SSD
1999
Springer
197views Database» more  SSD 1999»
13 years 11 months ago
3D Shape Histograms for Similarity Search and Classification in Spatial Databases
Classification is one of the basic tasks of data mining in modern database applications including molecular biology, astronomy, mechanical engineering, medical imaging or meteorolo...
Mihael Ankerst, Gabi Kastenmüller, Hans-Peter...