707 search results - page 84 / 142 » Processing queries on tree-structured data efficiently |
SIGMOD
2009
ACM
14 years 9 months ago
2009
ACM
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
SSDBM
1998
IEEE
14 years 29 days ago
1998
IEEE
: A new issue that arises in modern applications involves the efficient manipulation of (static or moving) spatial objects, and the relationships among them. As a result, modern da...
SSDBM
2010
IEEE
13 years 6 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
DOLAP
2005
ACM
13 years 10 months ago
2005
ACM
A novel framework for providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP is presented in this paper. Such a framework allows u...
VLDB
2004
ACM
14 years 9 months ago
2004
ACM
Indatawarehousingapplications,numerousOLAP queries involve the processing of holistic aggregators such as computing the "top n," median, quantiles, etc. In this paper, we...