Sciweavers

1157 search results - page 181 / 232
» Storing and Querying XML Data using an RDMBS
Sort
View
COMPGEOM
2010
ACM
14 years 1 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
ICDE
2010
IEEE
295views Database» more  ICDE 2010»
14 years 2 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
AMW
2010
13 years 9 months ago
Run-time Optimization for Pipelined Systems
Traditional optimizers fail to pick good execution plans, when faced with increasingly complex queries and large data sets. This failure is even more acute in the context of XQuery...
Riham Abdel Kader, Maurice van Keulen, Peter A. Bo...
NAR
2006
100views more  NAR 2006»
13 years 8 months ago
The LIFEdb database in 2006
LIFEdb (http://www.LIFEdb.de) integrates data from large-scale functional genomics assays and manual cDNA annotation with bioinformatics gene expression and protein analysis. New ...
Alexander Mehrle, Heiko Rosenfelder, Ingo Schupp, ...
IHI
2010
173views Healthcare» more  IHI 2010»
13 years 2 months ago
Towards large-scale sharing of electronic health records of cancer patients
The rising cost of healthcare is one of the major concerns faced by the nation. One way to lower healthcare costs and provide better quality care to patients is through the effect...
Praveen R. Rao, Stanley A. Edlavitch, Jeffrey L. H...