Sciweavers

2001 search results - page 180 / 401
» Indexing in a Hypertext Database
Sort
View
132
Voted
WAIM
2007
Springer
15 years 9 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...
99
Voted
ICDAR
2003
IEEE
15 years 8 months ago
Computerising Natural History Card Archives
This paper summarises the achievements of a multidisciplinary Bioinformatics project which has the objective of providing a general mechanism for efficient computerisation of type...
Andy C. Downton, Simon M. Lucas, Gregory Patoulas,...
145
Voted
DIS
2006
Springer
15 years 7 months ago
Itemset Support Queries Using Frequent Itemsets and Their Condensed Representations
The purpose of this paper is two-fold: First, we give efficient algorithms for answering itemset support queries for collections of itemsets from various representations of the fre...
Taneli Mielikäinen, Pance Panov, Saso Dzerosk...
139
Voted
DEXA
2008
Springer
155views Database» more  DEXA 2008»
15 years 5 months ago
NM-Tree: Flexible Approximate Similarity Search in Metric and Non-metric Spaces
So far, an efficient similarity search in multimedia databases has been carried out by metric access methods (MAMs), where the utilized similarity measure had to satisfy the metric...
Tomás Skopal, Jakub Lokoc
PARCO
1997
15 years 4 months ago
Parallel Database Techniques in Decision Support and Data Mining
During the last decade, all commercial database systems have included features for parallel processing into their products. This development has been driven by the fact that datab...
Andreas Reuter