Sciweavers

2001 search results - page 200 / 401
» Indexing in a Hypertext Database
Sort
View
ICDE
2009
IEEE
143views Database» more  ICDE 2009»
13 years 8 months ago
Incremental Reverse Nearest Neighbor Ranking
In this paper, we formalize the novel concept of incremental reverse nearest neighbor ranking and suggest an original solution for this problem. We propose an efficient approach fo...
Hans-Peter Kriegel, Peer Kröger, Matthias Ren...
PETRA
2009
ACM
14 years 4 months ago
Towards faster activity search using embedding-based subsequence matching
Event search is the problem of identifying events or activity of interest in a large database storing long sequences of activity. In this paper, our topic is the problem of identi...
Panagiotis Papapetrou, Paul Doliotis, Vassilis Ath...
ICDE
2001
IEEE
115views Database» more  ICDE 2001»
14 years 11 months ago
Incremental Computation and Maintenance of Temporal Aggregates
We consider the problems of computing aggregation queries in temporal databases, and of maintaining materialized temporal aggregate views efficiently. The latter problem is partic...
Jun Yang 0001, Jennifer Widom
VLDB
2007
ACM
91views Database» more  VLDB 2007»
14 years 10 months ago
On Dominating Your Neighborhood Profitably
Recent research on skyline queries has attracted much interest in the database and data mining community. Given a database, an object belongs to the skyline if it cannot be domina...
Cuiping Li, Anthony K. H. Tung, Wen Jin, Martin Es...
SIGMOD
2007
ACM
144views Database» more  SIGMOD 2007»
14 years 10 months ago
GhostDB: querying visible and hidden data without leaks
Imagine that you have been entrusted with private data, such as corporate product information, sensitive government information, or symptom and treatment information about hospita...
Nicolas Anciaux, Mehdi Benzine, Luc Bouganim, Phil...