Sciweavers

106 search results - page 5 / 22
» Scalable approximate query processing with the DBO engine
Sort
View
IPPS
2008
IEEE
14 years 1 months ago
Towards feasibility and scalability of text search in peer-to-peer systems
— In this paper, we introduce a search engine, Dgoogle, designed for large scale P2P systems. Dgoogle is purely text-based, does not organize documents based on pre-defined keyw...
A. Lal, V. Gupta, Khaled Harfoush, Injong Rhee
APWEB
2004
Springer
13 years 10 months ago
A Query-Dependent Duplicate Detection Approach for Large Scale Search Engines
Duplication of Web pages greatly hurts the perceived relevance of a search engine. Existing methods for detecting duplicated Web pages can be classified into two categories, i.e. o...
Shaozhi Ye, Ruihua Song, Ji-Rong Wen, Wei-Ying Ma
ICDM
2008
IEEE
117views Data Mining» more  ICDM 2008»
14 years 1 months ago
Semantic Full-Text Search with ESTER: Scalable, Easy, Fast
We present a demo of ESTER, a search engine that combines the ease of use, speed and scalability of full-text search with the powerful semantic capabilities of ontologies. ESTER s...
Holger Bast, Fabian M. Suchanek, Ingmar Weber
SIGMOD
2002
ACM
118views Database» more  SIGMOD 2002»
14 years 7 months ago
Compressing SQL workloads
Recently several important relational database tasks such as index selection, histogram tuning, approximate query processing, and statistics selection have recognized the importan...
Surajit Chaudhuri, Ashish Kumar Gupta, Vivek R. Na...
DOLAP
2005
ACM
13 years 9 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