415 search results - page 29 / 83 » Optimal query complexity bounds for finding graphs |
GIS
2005
ACM
14 years 8 months ago
2005
ACM
Group nearest neighbor (GNN) queries are a relatively new type of operations in spatial database applications. Different from a traditional kNN query which specifies a single quer...
VLDB
1991
ACM
13 years 11 months ago
1991
ACM
The development of a distributed database systemrequires effective solutions to many complex and interrelated design problems. The cost dependenciesbetween query optimization and ...
ICDE
1996
IEEE
14 years 9 months ago
1996
IEEE
This paper presents a difference calculus for determining changes to rule conditions in an active DBMS. The calculus has been used for implementing an algorithm to efficiently mon...
ICFP
2008
ACM
14 years 7 months ago
2008
ACM
Optimal path queries are queries to obtain an optimal path specified by a given criterion of optimality. There have been many studies to give efficient algorithms for classes of o...
EDBT
2008
ACM
14 years 7 months ago
2008
ACM
Scientific data are available through an increasing number of heterogeneous, independently evolving, sources. Although the sources themselves are independently evolving, the data ...