Sciweavers

348 search results - page 59 / 70
» An Efficient Index Lattice for XML Query Evaluation
Sort
View
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
14 years 7 months ago
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
Elke Achtert, Christian Böhm, Peer Kröge...
SIGMOD
2007
ACM
160views Database» more  SIGMOD 2007»
14 years 7 months ago
Supporting ranking and clustering as generalized order-by and group-by
The Boolean semantics of SQL queries cannot adequately capture the "fuzzy" preferences and "soft" criteria required in non-traditional data retrieval applicati...
Chengkai Li, Min Wang, Lipyeow Lim, Haixun Wang, K...
IWPC
2007
IEEE
14 years 1 months ago
Combining Formal Concept Analysis with Information Retrieval for Concept Location in Source Code
The paper addresses the problem of concept location in source code by presenting an approach which combines Formal Concept Analysis (FCA) and Latent Semantic Indexing (LSI). In th...
Denys Poshyvanyk, Andrian Marcus
VLDB
2005
ACM
113views Database» more  VLDB 2005»
14 years 7 months ago
Mediators over taxonomy-based information sources
Abstract. We propose a mediator model for providing integrated and unified access to multiple taxonomy-based sources. Each source comprises a taxonomy and a database that indexes o...
Yannis Tzitzikas, Nicolas Spyratos, Panos Constant...
VLDB
1995
ACM
129views Database» more  VLDB 1995»
13 years 11 months ago
A Cost Model for Clustered Object-Oriented Databases
Query processing is one of the most, critical issues in Object-Oriented DBMSs. Extensible opt,imizers with efficient, search strategies require a cost model to select the most eff...
Georges Gardarin, Jean-Robert Gruser, Zhao-Hui Tan...