Sciweavers

958 search results - page 34 / 192
» Efficient data structures for range-aggregate queries on tre...
Sort
View
97
Voted
ALGORITHMICA
2002
103views more  ALGORITHMICA 2002»
15 years 10 days ago
Efficient Bulk Operations on Dynamic R-Trees
In recent years there has been an upsurge of interest in spatial databases. A major issue is how to manipulate efficiently massive amounts of spatial data stored on disk in multidi...
Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey...
104
Voted
OPODIS
2004
15 years 1 months ago
Firewall Queries
Firewalls are crucial elements in network security, and have been widely deployed in most businesses and institutions for securing private networks. The function of a firewall is t...
Alex X. Liu, Mohamed G. Gouda, Huibo H. Ma, Anne H...
95
Voted
KDD
2002
ACM
144views Data Mining» more  KDD 2002»
16 years 26 days ago
Efficiently mining frequent trees in a forest
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in ...
Mohammed Javeed Zaki
SIS
2004
15 years 1 months ago
Efficient Tree Search in Encrypted Data
Abstract. Sometimes there is a need to store sensitive data on an untrusted database server. Song, Wagner and Perrig have introduced a way to search for the existence of a word in ...
Richard Brinkman, Ling Feng, Jeroen Doumen, Pieter...
187
Voted
ICDE
2008
IEEE
167views Database» more  ICDE 2008»
16 years 1 months ago
Towards Declarative Queries on Adaptive Data Structures
In this work we look at combining emerging technologies in programming languages with traditional query processing techniques to provide support for efficient execution of declarat...
Nicolas Bruno, Pablo Castro