Sciweavers

1497 search results - page 170 / 300
» Online Negative Databases
Sort
View
136
Voted
CIDR
2003
147views Algorithms» more  CIDR 2003»
15 years 6 months ago
Sorting And Indexing With Partitioned B-Trees
Partitioning within a B-tree, based on an artificial leading key column and combined with online reorganization, can be exploited during external merge sort for accurate deep read...
Goetz Graefe
BMCBI
2006
164views more  BMCBI 2006»
15 years 5 months ago
BIOZON: a system for unification, management and analysis of heterogeneous biological data
Integration of heterogeneous data types is a challenging problem, especially in biology, where the number of databases and data types increase rapidly. Amongst the problems that o...
Aaron Birkland, Golan Yona
NAR
2011
176views Computer Vision» more  NAR 2011»
14 years 7 months ago
IUPHAR-DB: new receptors and tools for easy searching and visualization of pharmacological data
The IUPHAR database is an established online reference resource for several important classes of human drug targets and related proteins. As well as providing recommended nomencla...
Joanna L. Sharman, Chidochangu P. Mpamhanga, Micha...
SIGMOD
2011
ACM
219views Database» more  SIGMOD 2011»
14 years 7 months ago
Context-sensitive ranking for document retrieval
We study the problem of context-sensitive ranking for document retrieval, where a context is defined as a sub-collection of documents, and is specified by queries provided by do...
Liang Jeff Chen, Yannis Papakonstantinou
SIGMOD
2012
ACM
276views Database» more  SIGMOD 2012»
13 years 7 months ago
SCARAB: scaling reachability computation on large graphs
Most of the existing reachability indices perform well on small- to medium- size graphs, but reach a scalability bottleneck around one million vertices/edges. As graphs become inc...
Ruoming Jin, Ning Ruan, Saikat Dey, Jeffrey Xu Yu