1018 search results - page 166 / 204 » On the minimization of XPath queries |
EDBT
2008
ACM
15 years 12 months ago
2008
ACM
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
IPTPS
2005
Springer
15 years 5 months ago
2005
Springer
Arpeggio is a peer-to-peer file-sharing network based on the Chord lookup primitive. Queries for data whose metadata matches a certain criterion are performed efficiently by using...
VLDB
1998
ACM
15 years 4 months ago
1998
ACM
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
SIGIR
2002
ACM
14 years 11 months ago
2002
ACM
The optimal settings of retrieval parameters often depend on both the document collection and the query, and are usually found through empirical tuning. In this paper, we propose ...
123
click to vote
PVLDB
2008
14 years 11 months ago
2008
We propose EndoScope, a software monitoring framework that allows users to pose declarative queries that monitor the state and performance of running programs. Unlike most existin...