Sciweavers

386 search results - page 19 / 78
» Probabilistic Ranking of Database Query Results
Sort
View
VLDB
2007
ACM
132views Database» more  VLDB 2007»
14 years 3 months ago
EntityRank: Searching Entities Directly and Holistically
As the Web has evolved into a data-rich repository, with the standard “page view,” current search engines are becoming increasingly inadequate for a wide range of query tasks....
Tao Cheng, Xifeng Yan, Kevin Chen-Chuan Chang
SIGMOD
2007
ACM
229views Database» more  SIGMOD 2007»
14 years 9 months ago
Spark: top-k keyword query in relational databases
With the increasing amount of text data stored in relational databases, there is a demand for RDBMS to support keyword queries over text data. As a search result is often assemble...
Yi Luo, Xuemin Lin, Wei Wang 0011, Xiaofang Zhou
EDBTW
2006
Springer
14 years 20 days ago
Models for Incomplete and Probabilistic Information
Abstract. We discuss, compare and relate some old and some new models for incomplete and probabilistic databases. We characterize the expressive power of c-tables over infinite dom...
Todd J. Green, Val Tannen
ICDE
2010
IEEE
213views Database» more  ICDE 2010»
14 years 10 days ago
TargetSearch: A Ranking Friendly XML Keyword Search Engine
Abstract-- This demo illustrates an XML search engine TargetSearch that addresses an open problem in XML keyword search: given relevant matches to keywords, how to compose query re...
Ziyang Liu, Yichuan Cai, Yi Chen
WWW
2002
ACM
14 years 9 months ago
Probabilistic query expansion using query logs
Query expansion has long been suggested as an effective way to resolve the short query and word mismatching problems. A number of query expansion methods have been proposed in tra...
Hang Cui, Ji-Rong Wen, Jian-Yun Nie, Wei-Ying Ma