1018 search results - page 124 / 204 » On the minimization of XPath queries |
136
click to vote
SODA
2012
ACM
13 years 4 months ago
2012
ACM
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
233
click to vote
SIGMOD
2009
ACM
16 years 1 months ago
2009
ACM
Solid state drives perform random reads more than 100x faster than traditional magnetic hard disks, while offering comparable sequential read and write bandwidth. Because of their...
185
Voted
VLDB
2007
ACM
16 years 1 months ago
2007
ACM
A "plan diagram" is a pictorial enumeration of the execution plan choices of a database query optimizer over the relational selectivity space. We have shown recently tha...
106
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...
INFOCOM
2007
IEEE
15 years 8 months ago
2007
IEEE
—The demand for efficient data dissemination/access techniques to find the relevant data from within a sensor network has led to the development of data-centric sensor networks...