Sciweavers

104 search results - page 21 / 21
» Fast Query Over Encrypted Character Data in Database
Sort
View
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
13 years 10 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
EDBT
2009
ACM
156views Database» more  EDBT 2009»
13 years 9 months ago
Secondary bitmap indexes with vertical and horizontal partitioning
Traditional bitmap indexes are utilized as a special type of primary or clustered indexes where the queries are answered by performing fast logical operations supported by hardwar...
Guadalupe Canahuate, Tan Apaydin, Ahmet Sacan, Hak...
VLDB
2007
ACM
155views Database» more  VLDB 2007»
14 years 5 months ago
Towards Graph Containment Search and Indexing
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
Chen Chen, Xifeng Yan, Philip S. Yu, Jiawei Han, D...
BMCBI
2007
217views more  BMCBI 2007»
13 years 4 months ago
OntologyWidget - a reusable, embeddable widget for easily locating ontology terms
Background: Biomedical ontologies are being widely used to annotate biological data in a computer-accessible, consistent and well-defined manner. However, due to their size and co...
Catherine Beauheim, Farrell Wymore, Michael Nitzbe...