453 search results - page 77 / 91 » Efficient Evaluation of Inbreeding Queries on Pedigree Data |
BTW
2007
Springer
15 years 1 months ago
2007
Springer
: Relational database systems are highly efficient hosts to table-shaped data. It is all the more interesting to see how a careful inspection of both, the XML tree structure as wel...
187
Voted
VLDB
2007
ACM
15 years 9 months ago
2007
ACM
Given a multidimensional point q, a reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k nearest neighbors. Existing methods for proc...
ADC
2008
Springer
14 years 11 months ago
2008
Springer
As the XML has become a standard for data representation, it is inevitable to propose and implement techniques for efficient managing of XML data. A natural alternative is to expl...
DBA
2004
14 years 11 months ago
2004
In order to guarantee efficient query processing together with industrial strength, spatial index structures have to be integrated into fully-fledged object-relational database ma...
PVLDB
2008
14 years 9 months ago
2008
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...