806 search results - page 84 / 162 » An Optimal Dynamic Data Structure for Stabbing-Semigroup Que... |
129
click to vote
SIGMOD
2001
ACM
16 years 1 months ago
2001
ACM
Virtually all proposals for querying XML include a class of query we term "containment queries". It is also clear that in the foreseeable future, a substantial amount of...
114
click to vote
PAKDD
2010
ACM
15 years 6 months ago
2010
ACM
In this paper, we propose a method for online subsequence matching between histogram-based stream synopsis structures under the dynamic warping distance. Given a query synopsis pat...
143
click to vote
CACM
1998
15 years 1 months ago
1998
abstraction for modeling these problems is to view the Web as a collection of (usually small and heterogeneous) databases, and to view programs that extract and process Web data au...
119
click to vote
MIDDLEWARE
2005
Springer
15 years 7 months ago
2005
Springer
These last years, the evolution of nomadic terminals and mobile networks has yield to the development of the ubiquitous computing. In this context, actual query evaluation and opt...
181
click to vote
VLDB
2006
ACM
16 years 1 months ago
2006
ACM
The objective of extensible DBMSs is to ease the construction of specialized DBMSs for nontraditional applications. Although much work has been done in providing various levels of ...