Sciweavers

525 search results - page 93 / 105
» On Query Algebras for Probabilistic Databases
Sort
View
PODS
2006
ACM
95views Database» more  PODS 2006»
14 years 7 months ago
Randomized computations on large data sets: tight lower bounds
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
André Hernich, Martin Grohe, Nicole Schweik...
SSDBM
2008
IEEE
131views Database» more  SSDBM 2008»
14 years 1 months ago
Linked Bernoulli Synopses: Sampling along Foreign Keys
Random sampling is a popular technique for providing fast approximate query answers, especially in data warehouse environments. Compared to other types of synopses, random sampling...
Rainer Gemulla, Philipp Rösch, Wolfgang Lehne...
INEX
2004
Springer
14 years 23 days ago
TIJAH at INEX 2004 Modeling Phrases and Relevance Feedback
This paper discusses our participation in INEX using the TIJAH XML-IR system. We have enriched the TIJAH system, which follows a standard layered database architecture, with severa...
Vojkan Mihajlovic, Georgina Ramírez, Arjen ...
VLDB
2007
ACM
132views Database» more  VLDB 2007»
14 years 1 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
DL
1999
Springer
139views Digital Library» more  DL 1999»
13 years 11 months ago
Constructing Web Views from Automated Navigation Sessions
Existing web search engines provide users with the ability to query an off-line database of indices in order to decide on an entry point for further manual navigation. Results are...
Nadav Zin, Mark Levene