486 search results - page 89 / 98 » An Efficient Path Index for Querying Semi-structured Data |
SIGMOD
2003
ACM
14 years 11 months ago
2003
ACM
Spatial database operations are typically performed in two steps. In the filtering step, indexes and the minimum bounding rectangles (MBRs) of the objects are used to quickly dete...
DKE
2008
13 years 11 months ago
2008
Due to the heterogeneous nature of XML data for internet applications exact matching of queries is often inadequate. The need arises to quickly identify subtrees of XML documents ...
VLDB
2007
ACM
14 years 11 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...
CBMS
2006
IEEE
14 years 4 months ago
2006
IEEE
With the advances in medical imaging devices, large volumes of high-resolution 3D medical image data have been produced. These high-resolution 3D data are very large in size, and ...
ICDIM
2010
IEEE
13 years 8 months ago
2010
IEEE
Data mining aims at extraction of previously unidentified information from large databases. It can be viewed as an automated application of algorithms to discover hidden patterns a...