221 search results - page 7 / 45 » Random Indexing K-tree |
SSDBM
1990
IEEE
13 years 11 months ago
1990
IEEE
In this paper we survey known results on algorithms, data structures, and some applications of random sampling from databases. We first discuss various reasons for sampling from d...
ICALP
2005
Springer
14 years 26 days ago
2005
Springer
In this paper we initiate the study of discrete random variables over domains. Our work is inspired by work of Daniele Varacca, who devised indexed valuations as models of probabi...
PVLDB
2010
13 years 5 months ago
2010
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
ICDE
2010
IEEE
14 years 2 months ago
2010
IEEE
—Data compression techniques such as null suppression and dictionary compression are commonly used in today’s database systems. In order to effectively leverage compression, it...
DCC
2008
IEEE
14 years 7 months ago
2008
IEEE
Recent advances in compressed data structures have led to the new concept of self-indexing; it is possible to represent a sequence of symbols compressed in a form that enables fas...