Sciweavers

258 search results - page 38 / 52
» Multidimensional Index Structures in Relational Databases
Sort
View
DBA
2004
111views Database» more  DBA 2004»
13 years 8 months ago
Effective Decompositioning of Complex Spatial Objects into Intervals
In order to guarantee efficient query processing together with industrial strength, spatial index structures have to be integrated into fully-fledged object-relational database ma...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
IPM
2006
167views more  IPM 2006»
13 years 6 months ago
Browsing mixed structured and unstructured data
Both structured and unstructured data, as well as structured data representing several different types of tuples, may be integrated into a single list for browsing or retrieval. D...
Robert M. Losee
ICDAR
2003
IEEE
14 years 21 hour ago
Symbolic Pruning in a Structural Approach to Engineering Drawing Analysis
Interpretation of paper drawings has received a good deal of attention over the last decade. Progress has also been made in related areas such as direct interpretation of human dr...
Tom Henderson, Lavanya Swaminatha
EDBT
2008
ACM
169views Database» more  EDBT 2008»
14 years 6 months ago
Efficient online top-K retrieval with arbitrary similarity measures
The top-k retrieval problem requires finding k objects most similar to a given query object. Similarities between objects are most often computed as aggregated similarities of the...
Prasad M. Deshpande, Deepak P, Krishna Kummamuru
DEXAW
2008
IEEE
120views Database» more  DEXAW 2008»
14 years 1 months ago
Self-Similarity Metric for Index Pruning in Conceptual Vector Space Models
— One of the critical issues in search engines is the size of search indexes: as the number of documents handled by an engine increases, the search must preserve its efficiency,...
Dario Bonino, Fulvio Corno