6274 search results - page 474 / 1255 » From query complexity to computational complexity |
342
click to vote
ICDE
2003
IEEE
16 years 8 months ago
2003
IEEE
This paper presents SPEX, a streamed and progressive evaluation of regular path expressions with XPath-like qualifiers against XML streams. SPEX proceeds as follows. An expression...
209
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
223
click to vote
CAISE
2003
Springer
16 years 4 days ago
2003
Springer
Abstract. Even though SQL has become widely accepted as a language for implementing relational database schemas and querying data, there are cases where s experience the need for n...
200
click to vote
EUROSYS
2007
ACM
16 years 4 months ago
2007
ACM
Data centers are often under-utilized due to over-provisioning as well as time-varying resource demands of typical enterprise applications. One approach to increase resource utili...
219
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
Regular expression matching is a key task (and often computational bottleneck) in a variety of software tools and applications. For instance, the standard grep and sed utilities, ...