Sciweavers

1143 search results - page 79 / 229
» Querying Probabilistic Information Extraction
Sort
View
TKDE
2008
231views more  TKDE 2008»
15 years 18 days ago
Personalized Concept-Based Clustering of Search Engine Queries
A major problem of current Web search is that search queries are usually short and ambiguous, and thus are insufficient for specifying the precise user needs. To alleviate this pro...
Kenneth Wai-Ting Leung, Wilfred Ng, Dik Lun Lee
107
Voted
ICDE
2010
IEEE
219views Database» more  ICDE 2010»
16 years 13 days ago
PIP: A Database System for Great and Small Expectations
Estimation via sampling out of highly selective join queries is well known to be problematic, most notably in online aggregation. Without goal-directed sampling strategies, samples...
Oliver Kennedy, Christoph Koch
DOLAP
2005
ACM
15 years 2 months ago
Providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP
A novel framework for providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP is presented in this paper. Such a framework allows u...
Alfredo Cuzzocrea
192
Voted
ICDE
2007
IEEE
173views Database» more  ICDE 2007»
16 years 2 months ago
Accelerating Profile Queries in Elevation Maps
Elevation maps are a widely used spatial data representation in geographical information systems (GIS). Paths on elevation maps can be characterized by profiles, which describe re...
Feng Pan, Wei Wang 0010, Leonard McMillan
92
Voted
WWW
2005
ACM
16 years 1 months ago
Scaling link-based similarity search
To exploit the similarity information hidden in the hyperlink structure of the web, this paper introduces algorithms scalable to graphs with billions of vertices on a distributed ...
Balázs Rácz, Dániel Fogaras