Sciweavers

2070 search results - page 196 / 414
» Querying Communities in Relational Databases
Sort
View
BDA
2007
15 years 1 months ago
Hyperplane Queries in a Feature-Space M-tree for Speeding up Active Learning
In content-based retrieval, relevance feedback (RF) is a noticeable method for reducing the “semantic gap” between the low-level features describing the content and the usually...
Michel Crucianu, Daniel Estevez, Vincent Oria, Jea...
IS
2007
14 years 11 months ago
Branch-and-bound processing of ranked queries
Despite the importance of ranked queries in numerous applications involving multi-criteria decision making, they are not efficiently supported by traditional database systems. In ...
Yufei Tao, Vagelis Hristidis, Dimitris Papadias, Y...
ICDE
1999
IEEE
113views Database» more  ICDE 1999»
16 years 29 days ago
I/O Complexity for Range Queries on Region Data Stored Using an R-tree
In this paper we study the node distribution of an Rtree storing region data, like for instance islands, lakes or human-inhabited areas. We will show that real region datasets are...
Guido Proietti, Christos Faloutsos
CORR
2011
Springer
144views Education» more  CORR 2011»
14 years 3 months ago
Rewriting Ontological Queries into Small Nonrecursive Datalog Programs
Abstract. We consider the setting of ontological database access, where an Abox is given in form of a relational database D and where a Boolean conjunctive query q has to be evalua...
Georg Gottlob, Thomas Schwentick
SIGMOD
2004
ACM
163views Database» more  SIGMOD 2004»
15 years 11 months ago
Rank-aware Query Optimization
Ranking is an important property that needs to be fully supported by current relational query engines. Recently, several rank-join query operators have been proposed based on rank...
Ihab F. Ilyas, Rahul Shah, Walid G. Aref, Jeffrey ...