Sciweavers

5221 search results - page 94 / 1045
» An On-line Problem Database
Sort
View
BTW
2005
Springer
118views Database» more  BTW 2005»
15 years 3 months ago
The MINERVA Project: Database Selection in the Context of P2P Search
: This paper presents the MINERVA project that protoypes a distributed search engine based on P2P techniques. MINERVA is layered on top of a Chord-style overlay network and uses a ...
Matthias Bender, Sebastian Michel, Gerhard Weikum,...
EDBT
2009
ACM
108views Database» more  EDBT 2009»
15 years 2 months ago
Reverse k-nearest neighbor search in dynamic and general metric databases
In this paper, we propose an original solution for the general reverse k-nearest neighbor (RkNN) search problem. Compared to the limitations of existing methods for the RkNN searc...
Elke Achtert, Hans-Peter Kriegel, Peer Kröger...
TKDE
2002
141views more  TKDE 2002»
14 years 9 months ago
Algorithms for Finding Attribute Value Group for Binary Segmentation of Categorical Databases
We consider the problem of finding a set of attribute values that give a high quality binary segmentation of a database. The quality of a segmentation is defined by an objective fu...
Yasuhiko Morimoto, Takeshi Fukuda, Takeshi Tokuyam...
IV
2006
IEEE
98views Visualization» more  IV 2006»
15 years 3 months ago
Database and Narratological Representation of Australian Aboriginal Knowledge as Information Visualisation using a Game Engine
Current database technologies do not support contextualised representations of multi-dimensional narratives. This paper outlines a new approach to this problem using a multi-dimen...
Malcolm Pumpa, Theodor G. Wyeld
VLDB
1989
ACM
97views Database» more  VLDB 1989»
15 years 1 months ago
Finding Regular Simple Paths in Graph Databases
We consider the following problem: given a labelled directedgraphG anda regularexpressionR, find all pairs of nodesconnectedby a simplepathsuchthattheconcatenationof thelabelsalon...
Alberto O. Mendelzon, Peter T. Wood