958 search results - page 134 / 192 » Efficient data structures for range-aggregate queries on tre... |
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Many real-world data are maintained in relational format, with different tables storing information about entities and their links or relationships. The structure (schema) of the ...
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
We present the first uniquely represented data structure for an external memory model of computation, a B-tree analogue called a B-treap. Uniquely represented data structures repre...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
We propose to design data structures called succinct geometric indexes of negligible space (more precisely, o(n) bits) that support geometric queries in optimal time, by taking adv...
180
click to vote
VLDB
2007
ACM
15 years 10 months ago
2007
ACM
The modeling of high level semantic events from low level sensor signals is important in order to understand distributed phenomena. For such content-modeling purposes, transformat...
118
click to vote
SIGIR
2012
ACM
13 years 11 days ago
2012
ACM
Combating Web spam is one of the greatest challenges for Web search engines. State-of-the-art anti-spam techniques focus mainly on detecting varieties of spam strategies, such as ...