344 search results - page 44 / 69 » Adaptive indexing for relational keys |
SIGMOD
2008
ACM
14 years 11 months ago
2008
ACM
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
SIGMOD
2005
ACM
14 years 11 months ago
2005
ACM
XML documents are normally stored as plain text files. Hence, the natural and most convenient way to update XML documents is to simply edit the text files. But efficient query eva...
ALGORITHMICA
2000
13 years 10 months ago
2000
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
SFM
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. As systems become more service oriented and processes increasingly cross organizational boundaries, interaction becomes more important. New technologies support the devel...
INFOCOM
2008
IEEE
14 years 5 months ago
2008
IEEE
—We consider wireless mesh networks, and exploit the inherent broadcast nature of wireless by making use of multipath routing. We present an optimization framework that enables u...