2514 search results - page 215 / 503 » On the Computation of Approximations of Database Queries |
271
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
This paper addresses the efficient processing of similarity queries in metric spaces, where data is horizontally distributed across a P2P network. The proposed approach does not r...
223
click to vote
DASFAA
2008
IEEE
15 years 8 months ago
2008
IEEE
An important issue arising from XML query relaxation is how to efficiently search the top-k best answers from a large number of XML data sources, while minimizing the searching cos...
178
click to vote
ICDE
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract--Cloud computing, the new trend for service infrastructures requires user multi-tenancy as well as minimal capital expenditure. In a cloud that services large amounts of d...
284
click to vote
PODS
2009
ACM
16 years 7 months ago
2009
ACM
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
173
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...