Database preprocessing in order to create an index often permits considerable speedup in search compared to the iterated query of an unprocessed database. In this paper we apply index-based database lookup to a range search problem that arises in mass spectrometry-based proteomics: given a large collection of sparse integer sets and a sparse query set, find all the sets from the collection that...

Tracking the pose of a moving hand from a monocular perspective is a difficult problem. In the current study the tracking problem is recast as efficient database indexing. Recognition is hastened by approximating chamfer distances between hand poses which have been embedded into a common vector space. Using this embedding, a small number of candidate matches for each query can be quickly identi...

WEI-HO TSAI, YEONG-YUH XU, JUN-HAO CHIEN AND WEN-TZENG HUANG Department of Electronic Engineering Graduate Institute of Computer and Communication Engineering National Taipei University of Technology Taipei, 106 Taiwan E-mail: {whtsai, 98418036}@ntut.edu.tw Department of Computer Science and Information Engineering Hungkuang University Taichung, 433 Taiwan E-mail: [email protected] Departm...

Although object oriented database systems o er more powerful modeling capability than relational database systems their performance su ers from the increased complexity in the data model Thus e cient index mech anisms must be used to improve the performance In this paper two new signature methods for indexing object oriented databases and the associated operations are de scribed The cost models...

In logic, the spatio-temporal location of a proposition is characterized precisely within a Cartesian system of space and time coordinates. This is suitable for characterizing the truth value of propositions relative to possible worlds, but not for modeling the spatio-temporal orientation of natural cognitive agents.1 This paper presents an alternative approach to representing space and time. W...

MOTIVATION The BLAST software package for sequence comparison speeds up homology search by preprocessing a query sequence into a lookup table. Numerous research studies have suggested that preprocessing the database instead would give better performance. However, production usage of sequence comparison methods that preprocess the database has been limited to programs such as BLAT and SSAHA that...

One of the distinctive features of Information Retrieval systems comparing to Database Management systems, is that they offer better compression for posting lists, resulting in better I/O performance and thus faster query evaluation. In this paper, we introduce database representations of the index that reduce the size (and thus the disk I/Os) of the posting lists. This is not achieved by redes...

Signature indexing has been studied extensively in text database or other databases for many years. The main advantages of a signature le as an access index are its small size, distributability, the ability to index information of a wide variety of types, ease of maintenance, and the ability to provide fuzzy indexing. These features are precisely what are needed for a good access index for inde...

A current trend in database architecture is to provide 'data blades' or 'data cartridges' as 'plug-in' indexing methods to support new data types. The research project which gave rise to this paper aims to test the practicality of a diametrically opposite approach: the development of a new, generic indexing technology i.e. a single indexing technique capable of supporting a wide range of data t...

We describe a technique for fast compression of time series, indexing of compressed series, and retrieval of series similar to a given pattern. The compression procedure identifies “important” points of a series and discards the other points. We use the important points not only for compression, but also for indexing a database of time series. Experiments show the effectiveness of this techniqu...