Sciweavers

2514 search results - page 39 / 503
» On the Computation of Approximations of Database Queries
Sort
View
CSB
2005
IEEE
136views Bioinformatics» more  CSB 2005»
15 years 11 months ago
Computational Method for Temporal Pattern Discovery in Biomedical Genomic Databases
With the rapid growth of biomedical research databases, opportunities for scientific inquiry have expanded quickly and led to a demand for computational methods that can extract b...
Mohammed I. Rafiq, Martin J. O'Connor, Amar K. Das
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
15 years 11 months ago
Computing label-constraint reachability in graph databases
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yan...
ICDE
2010
IEEE
295views Database» more  ICDE 2010»
16 years 1 months ago
K nearest neighbor queries and kNN-Joins in large relational databases (almost) for free
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
Bin Yao, Feifei Li, Piyush Kumar
ICDE
2009
IEEE
164views Database» more  ICDE 2009»
16 years 8 months ago
Efficient and Robust Database Support for Data-Intensive Applications in Dynamic Environments
Requirements from new types of applications call for new database system solutions. Computational science applications performing distributed computations on Grid networks with req...
Jon Olav Hauglid, Kjetil Nørvåg, Norv...
ICDE
2008
IEEE
157views Database» more  ICDE 2008»
16 years 7 months ago
TALE: A Tool for Approximate Large Graph Matching
Abstract-- Large graph datasets are common in many emerging database applications, and most notably in large-scale scientific applications. To fully exploit the wealth of informati...
Yuanyuan Tian, Jignesh M. Patel