Sciweavers

610 search results - page 53 / 122
» Efficient Query Evaluation on Probabilistic Databases
Sort
View
75
Voted
KES
2007
Springer
15 years 6 months ago
NBM and WNBM: Algorithms and Evaluation for Personalizing Information Retrieval in METIORE
The current Information Retrieval Systems return hundreds or thousands of documents in response to a query. Users consider only the first 20 or 30, but documents are often sorted a...
David Bueno, Ricardo Conejo, Amos David, Cristina ...
SIGMOD
2001
ACM
120views Database» more  SIGMOD 2001»
16 years 21 days ago
Materialized View Selection and Maintenance Using Multi-Query Optimization
Materialized views have been found to be very effective at speeding up queries, and are increasingly being supported by commercial databases and data warehouse systems. However, w...
Hoshi Mistry, Prasan Roy, S. Sudarshan, Krithi Ram...
VLDB
1989
ACM
155views Database» more  VLDB 1989»
15 years 4 months ago
Parallel Processing of Recursive Queries in Distributed Architectures
This paper presents a parallel algorithm for recursive query processing and shows how it can be efficiently implemented in a local computer network. The algorithm relies on an int...
Guy Hulin
VLDB
2007
ACM
121views Database» more  VLDB 2007»
16 years 23 days ago
Efficient Keyword Search over Virtual XML Views
Emerging applications such as personalized portals, enterprise search and web integration systems often require keyword search over semi-structured views. However, traditional inf...
Feng Shao, Lin Guo, Chavdar Botev, Anand Bhaskar, ...
SSDBM
2000
IEEE
168views Database» more  SSDBM 2000»
15 years 4 months ago
pCube: Update-Efficient Online Aggregation with Progressive Feedback and Error Bounds
Multidimensional data cubes are used in large data warehouses as a tool for online aggregation of information. As the number of dimensions increases, supporting efficient queries ...
Mirek Riedewald, Divyakant Agrawal, Amr El Abbadi