Sciweavers

11211 search results - page 1710 / 2243
» Rank-Sensitive Data Structures
Sort
View
STOC
2002
ACM
140views Algorithms» more  STOC 2002»
16 years 6 months ago
Finding nearest neighbors in growth-restricted metrics
Most research on nearest neighbor algorithms in the literature has been focused on the Euclidean case. In many practical search problems however, the underlying metric is non-Eucl...
David R. Karger, Matthias Ruhl
OSDI
2008
ACM
16 years 6 months ago
SQCK: A Declarative File System Checker
The lowly state of the art for file system checking and repair does not match what is needed to keep important data available for users. Current file system checkers, such as e2fs...
Haryadi S. Gunawi, Abhishek Rajimwale, Andrea C. A...
VLDB
2001
ACM
119views Database» more  VLDB 2001»
16 years 6 months ago
PicoDBMS: Scaling down database techniques for the smartcard
Smartcards are the most secure portable computing device today. They have been used successfully in applications involving money, proprietary and personal data (such as banking, h...
Philippe Pucheral, Luc Bouganim, Patrick Valduriez...
VLDB
2004
ACM
144views Database» more  VLDB 2004»
16 years 6 months ago
Preserving mapping consistency under schema changes
Abstract. In dynamic environments like the Web, data sources may change not only their data but also their schemas, their semantics, and their query capabilities.When a mapping is ...
Yannis Velegrakis, Renée J. Miller, Lucian Popa
VLDB
2007
ACM
145views Database» more  VLDB 2007»
16 years 6 months ago
LCS-TRIM: Dynamic Programming Meets XML Indexing and Querying
In this article, we propose a new approach for querying and indexing a database of trees with specific applications to XML datasets. Our approach relies on representing both the q...
Shirish Tatikonda, Srinivasan Parthasarathy, Matth...
« Prev « First page 1710 / 2243 Last » Next »