Sciweavers

4790 search results - page 450 / 958
» Reverse Query Processing
Sort
View
BMCBI
2004
189views more  BMCBI 2004»
15 years 4 months ago
B.E.A.R. GeneInfo: A tool for identifying gene-related biomedical publications through user modifiable queries
Background: Once specific genes are identified through high throughput genomics technologies there is a need to sort the final gene list to a manageable size for validation studie...
Guohui Zhou, Xinyu Wen, Hang Liu, Michael J. Schli...
SSD
2007
Springer
243views Database» more  SSD 2007»
15 years 11 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...
ICDE
2009
IEEE
183views Database» more  ICDE 2009»
16 years 6 months ago
Efficient Indices Using Graph Partitioning in RDF Triple Stores
With the advance of the Semantic Web, varying RDF data were increasingly generated, published, queried, and reused via the Web. For example, the DBpedia, a community effort to extr...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...
SIGMOD
2008
ACM
158views Database» more  SIGMOD 2008»
16 years 4 months ago
Column-stores vs. row-stores: how different are they really?
There has been a significant amount of excitement and recent work on column-oriented database systems ("column-stores"). These database systems have been shown to perfor...
Daniel J. Abadi, Samuel Madden, Nabil Hachem
SIGMOD
2012
ACM
203views Database» more  SIGMOD 2012»
13 years 7 months ago
Optimizing index for taxonomy keyword search
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
Bolin Ding, Haixun Wang, Ruoming Jin, Jiawei Han, ...