3122 search results - page 280 / 625 » Storing Semistructured Data with STORED |
169
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
—Many popular algorithms for fast packet forwarding and filtering rely on the tree data structure. Examples are the trie-based IP lookup and packet classification algorithms. W...
195
click to vote
DATESO
2009
15 years 4 months ago
2009
Indexing methods for efficient processing of multidimensional data are very requested in many fields, like geographical information systems, drawing documentations etc. Well-known ...
257
click to vote
AROBOTS
2011
15 years 1 months ago
2011
— Database of human motion has been widely used for recognizing human motion and synthesizing humanoid motions. In this paper, we propose a data structure for storing and extract...
258
click to vote
SIGMETRICS
2010
ACM
15 years 1 months ago
2010
ACM
Space efficiency and data reliability are two primary concerns for modern storage systems. Chunk-based deduplication, which breaks up data objects into single-instance chunks that...
220
click to vote
SIGMOD
2011
ACM
14 years 9 months ago
2011
ACM
To achieve high reliability and scalability, most large-scale data warehouse systems have adopted the cluster-based architecture. In this paper, we propose the design of a new clu...