Sciweavers

458 search results - page 16 / 92
» Multi-query Optimization for Distributed Similarity Query Pr...
Sort
View
DEXA
2005
Springer
80views Database» more  DEXA 2005»
14 years 2 months ago
Optimizing I/O Costs of Multi-dimensional Queries Using Bitmap Indices
Bitmap indices are efficient data structures for processing complex, multi-dimensional queries in data warehouse applications and scientific data analysis. For high-cardinality at...
Doron Rotem, Kurt Stockinger, Kesheng Wu
BMCBI
2008
142views more  BMCBI 2008»
13 years 9 months ago
Optimal neighborhood indexing for protein similarity search
Background: Similarity inference, one of the main bioinformatics tasks, has to face an exponential growth of the biological data. A classical approach used to cope with this data ...
Pierre Peterlongo, Laurent Noé, Dominique L...
SIGMOD
2010
ACM
308views Database» more  SIGMOD 2010»
13 years 7 months ago
GBLENDER: towards blending visual query formulation and query processing in graph databases
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
Changjiu Jin, Sourav S. Bhowmick, Xiaokui Xiao, Ja...
ICASSP
2011
IEEE
13 years 15 days ago
Non-linear tagging models with localist and distributed word representations
Distributed representations of words are attractive since they provide a means for measuring word similarity. However, most approaches to learning distributed representations are ...
Sumit Chopra, Srinivas Bangalore
SIGMOD
2002
ACM
137views Database» more  SIGMOD 2002»
13 years 8 months ago
Partial results for online query processing
Traditional query processors generate full, accurate query results, either in batch or in pipelined fashion. We argue that this strict model is too rigid for exploratory queries o...
Vijayshankar Raman, Joseph M. Hellerstein