138 search results - page 22 / 28 » Lower Bounds for Succinct Data Structures |
162
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Matching dependencies were recently introduced as declarative rules for data cleaning and entity resolution. Enforcing a matching dependency on a database instance identifies the ...
161
Voted
SIGMOD
2001
ACM
16 years 3 months ago
2001
ACM
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
135
click to vote
FOCS
2005
IEEE
15 years 9 months ago
2005
IEEE
Fredman, Sedgewick, Sleator, and Tarjan proposed the pairing heap as a self-adjusting, streamlined version of the Fibonacci heap. It provably supports all priority queue operation...
153
Voted
ALENEX
2009
15 years 4 months ago
2009
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
143
Voted
CORR
2012
Springer
13 years 11 months ago
2012
Springer
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...