1018 search results - page 37 / 204 » On the minimization of XPath queries |
198
click to vote
ICDE
2005
IEEE
16 years 1 months ago
2005
IEEE
The ability to compute top-k matches to XML queries is gaining importance due to the increasing number of large XML repositories. The efficiency of top-k query evaluation relies o...
110
click to vote
BNCOD
2009
15 years 29 days ago
2009
We study the expressiveness of a positive fragment of path queries, denoted Path+ , on node-labeled trees documents. The expressiveness of Path+ is studied from two angles. First, ...
ICDE
2010
IEEE
15 years 11 months ago
2010
IEEE
In three-tiered web applications, some form of admission control is required to ensure that throughput and response times are not significantly harmed during periods of heavy load....
IS
2006
14 years 12 months ago
2006
As XML documents contain both content and structure information, taking advantage of the document structure in the retrieval process can lead to better identify relevant informati...
104
click to vote
ICALP
2005
Springer
15 years 5 months ago
2005
Springer
We study a clean machine model for external memory and stream processing. We show that the number of scans of the external data induces a strict hierarchy (as long as work space is...