6905 search results - page 327 / 1381 » Querying Multidimensional Databases |
189
click to vote
WISE
2003
Springer
15 years 12 months ago
2003
Springer
In this paper, we further develop a proposed layered approach for the Semantic Web. Our objective is to build a specific solution to the problem of providing data interoperability...
281
Voted
ICDE
2009
IEEE
16 years 8 months ago
2009
IEEE
Directions search returns the shortest path from a source to a destination on a road network. However, the search interests of users may be exposed to the service providers, thus r...
262
click to vote
ICDE
2001
IEEE
16 years 8 months ago
2001
IEEE
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
318
click to vote
SIGMOD
2005
ACM
16 years 6 months ago
2005
ACM
Given a set of objects P and a query point q, a k nearest neighbor (k-NN) query retrieves the k objects in P that lie closest to q. Even though the problem is well-studied for sta...
236
click to vote
XIMEP
2006
ACM
16 years 20 days ago
2006
ACM
We discuss query evaluation for XML-based server systems where the same query is evaluated on every incoming XML message. In a typical scenario, many of the incoming messages will...