Sciweavers

386 search results - page 23 / 78
» Probabilistic Ranking of Database Query Results
Sort
View
ICDE
2008
IEEE
241views Database» more  ICDE 2008»
14 years 10 months ago
PictureBook: A Text-and-Image Summary System for Web Search Result
Search engine technology plays an important role in Web information retrieval. However, with Internet information explosion, traditional searching techniques cannot provide satisfa...
Baile Shi, Guoyu Hao, Hongtao Xu, Mei Wang, Qi Zha...
CIKM
2008
Springer
13 years 10 months ago
A language for manipulating clustered web documents results
We propose a novel conception language for exploring the results retrieved by several internet search services (like search engines) that cluster retrieved documents. The goal is ...
Gloria Bordogna, Alessandro Campi, Giuseppe Psaila...
SIGMOD
2011
ACM
199views Database» more  SIGMOD 2011»
12 years 11 months ago
Schema-as-you-go: on probabilistic tagging and querying of wide tables
The emergence of Web 2.0 has resulted in a huge amount of heterogeneous data that are contributed by a large number of users, engendering new challenges for data management and qu...
Meiyu Lu, Divyakant Agrawal, Bing Tian Dai, Anthon...
SIGMOD
2003
ACM
145views Database» more  SIGMOD 2003»
14 years 9 months ago
Evaluating Probabilistic Queries over Imprecise Data
Many applications employ sensors for monitoring entities such as temperature and wind speed. A centralized database tracks these entities to enable query processing. Due to contin...
Reynold Cheng, Dmitri V. Kalashnikov, Sunil Prabha...
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
14 years 9 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang