Sciweavers

386 search results - page 18 / 78
» Probabilistic Ranking of Database Query Results
Sort
View
AAAI
2008
13 years 11 months ago
Efficient Querying Relaxed Dominant Relationship between Product Items Based on Rank Aggregation
Current search engines cannot effectively rank those relational data, which exists on dynamic websites supported by online databases. In this study, to rank such structured data, ...
Zhenglu Yang, Lin Li, Masaru Kitsuregawa
ERCIMDL
2007
Springer
87views Education» more  ERCIMDL 2007»
14 years 3 months ago
A Model of Uncertainty for Near-Duplicates in Document Reference Networks
We introduce a model of uncertainty where documents are not uniquely identified in a reference network, and some links may be incorrect. It generalizes the probabilistic approach ...
Claudia Hess, Michel de Rougemont
VLDB
2000
ACM
121views Database» more  VLDB 2000»
14 years 17 days ago
Optimizing Multi-Feature Queries for Image Databases
In digital libraries image retrieval queries can be based on the similarity of objects, using several feature attributes like shape, texture, color or text. Such multi-feature que...
Ulrich Güntzer, Wolf-Tilo Balke, Werner Kie&s...
SIGMOD
2001
ACM
108views Database» more  SIGMOD 2001»
14 years 9 months ago
PREFER: A System for the Efficient Execution of Multi-parametric Ranked Queries
Users often need to optimize the selection of objects by appropriately weighting the importance of multiple object attributes. Such optimization problems appear often in operation...
Vagelis Hristidis, Nick Koudas, Yannis Papakonstan...
SMC
2010
IEEE
124views Control Systems» more  SMC 2010»
13 years 7 months ago
SoftFacts: A top-k retrieval engine for ontology mediated access to relational databases
—We outline SoftFacts, an ontology mediated top-k information retrieval system over relational databases. An ontology layer is used to define (in terms of a OWL-QL like Semantic...
Umberto Straccia