Sciweavers

199 search results - page 21 / 40
» A Performance Comparison of bitmap indexes
Sort
View
ICDE
2007
IEEE
151views Database» more  ICDE 2007»
16 years 1 months ago
Fast, Secure Encryption for Indexing in a Column-Oriented DBMS
Networked information systems require strong security guarantees because of the new threats that they face. Various forms of encryption have been proposed to deal with this proble...
Tingjian Ge, Stanley B. Zdonik
BIOINFORMATICS
2011
14 years 3 months ago
RINQ: Reference-based Indexing for Network Queries
We consider the problem of similarity queries in biological network databases. Given a database of networks, similarity query returns all the database networks whose similarity (i...
Günhan Gülsoy, Tamer Kahveci
SSDBM
2010
IEEE
220views Database» more  SSDBM 2010»
15 years 4 months ago
Prefix Tree Indexing for Similarity Search and Similarity Joins on Genomic Data
Similarity search and similarity join on strings are important for applications such as duplicate detection, error detection, data cleansing, or comparison of biological sequences....
Astrid Rheinländer, Martin Knobloch, Nicky Ho...
JCST
2006
65views more  JCST 2006»
15 years 5 days ago
P-Tree Structures and Event Horizon: Efficient Event-Set Implementations
This paper describes efficient data structures, namely the Indexed P-tree, Block P-tree, and Indexed-Block P-tree (or IP-tree, BP-tree, and IBP-tree, respectively, for short), for...
Katerina Asdre, Stavros D. Nikolopoulos
ADBIS
1995
Springer
76views Database» more  ADBIS 1995»
15 years 3 months ago
Towards a Realistic Model of Indices in Object Bases
A comparison of several indexing techniques for complex object in object-oriented database systems is presented, based on assumption of non-uniform distribution of attribute value...
Boris Novikov