958 search results - page 52 / 192 » Efficient data structures for range-aggregate queries on tre... |
222
Voted
ICDE
2009
IEEE
16 years 2 months ago
2009
IEEE
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
163
Voted
GBRPR
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. This paper proposes an expert peering system for information exchange. Our objective is to develop a real-time search engine for an online community where users can ask e...
111
click to vote
IPL
2006
15 years 15 days ago
2006
A precise analysis of the retrieval of signature trees is presented. A signature tree is a data structure constructed over a signature file to speed up searching all those signatu...
156
Voted
COMPGEOM
2010
ACM
15 years 5 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
109
Voted
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...