611 search results - page 50 / 123 » Querying Tree-Structured Data Using Dimension Graphs |
ER
2007
Springer
14 years 4 months ago
2007
Springer
To be a full-featured data exchange format, XML should support not only queries but also updates on its contents. The new W3C XML update facility has proposed a set of operators (...
ICDE
2010
IEEE
14 years 5 months ago
2010
IEEE
— 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...
PVLDB
2008
13 years 9 months ago
2008
The class of k Nearest Neighbor (kNN) queries is frequently used in geospatial applications. Many studies focus on processing kNN in Euclidean and road network spaces. Meanwhile, ...
IPPS
1999
IEEE
14 years 2 months ago
1999
IEEE
Multidimensional Analysis and On-Line Analytical Processing (OLAP) uses summary information that requires aggregate operations along one or more dimensions of numerical data value...
WWW
2008
ACM
14 years 10 months ago
2008
ACM
Easy reuse and integration of declaratively described information in a distributed setting is one of the main motivations for building the Semantic Web. Despite of this claim, reu...