1018 search results - page 130 / 204 » On the minimization of XPath queries |
269
click to vote
ICDE
2005
IEEE
16 years 3 months ago
2005
IEEE
We study several transparent techniques for scaling dynamic content web sites, and we evaluate their relative impact when used in combination. Full transparency implies strong dat...
188
click to vote
SIGMOD
2007
ACM
16 years 1 months ago
2007
ACM
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
EDBT
2002
ACM
16 years 1 months ago
2002
ACM
For a spatial database management system, it is an important goal to minimize the I/O-cost of queries and other operations. Several page-replacement strategies have been proposed a...
109
click to vote
EDBT
2009
ACM
15 years 8 months ago
2009
ACM
Currently, a huge amount of biological data can be naturally represented by graphs, e.g., protein interaction networks, gene regulatory networks, etc. The need for indexing large ...
103
click to vote
MDM
2009
Springer
15 years 8 months ago
2009
Springer
Continuous queries in Wireless Sensor Networks (WSNs) are founded on the premise of Query Routing Tree structures (denoted as T), which provide sensors with a path to the querying...