Sciweavers

79 search results - page 4 / 16
» Efficient indexing structure for scalable processing of spat...
Sort
View
80
Voted
CIKM
2005
Springer
15 years 3 months ago
Exact match search in sequence data using suffix trees
We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...
Mihail Halachev, Nematollaah Shiri, Anand Thamildu...
ICMCS
2006
IEEE
120views Multimedia» more  ICMCS 2006»
15 years 3 months ago
An Efficient Numeric Indexing Technique for Music Retrieval System
Space requirement for storing indexes and performance for query processing are two critical issues in music information retrieval (MIR) system. To overcome difficulties in variabl...
Chuan-Wang Chang, Hewijin Christine Jiau
GEOINFO
2003
14 years 11 months ago
Efficient Query Processing on the Relational Quadtree
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existing...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
VLDB
2005
ACM
120views Database» more  VLDB 2005»
15 years 3 months ago
Efficiently Processing Queries on Interval-and-Value Tuples in Relational Databases
With the increasing occurrence of temporal and spatial data in present-day database applications, the interval data type is adopted by more and more database systems. For an effic...
Jost Enderle, Nicole Schneider, Thomas Seidl
75
Voted
SSDBM
1998
IEEE
101views Database» more  SSDBM 1998»
15 years 1 months ago
Specifications for Efficient Indexing in Spatiotemporal Databases
: A new issue that arises in modern applications involves the efficient manipulation of (static or moving) spatial objects, and the relationships among them. As a result, modern da...
Yannis Theodoridis, Timos K. Sellis, Apostolos Pap...