Sciweavers

654 search results - page 75 / 131
» Complexity of Answering Queries Using Materialized Views
Sort
View
VLDB
2001
ACM
139views Database» more  VLDB 2001»
15 years 4 months ago
NetCube: A Scalable Tool for Fast Data Mining and Compression
We propose an novel method of computing and storing DataCubes. Our idea is to use Bayesian Networks, which can generate approximate counts for any query combination of attribute v...
Dimitris Margaritis, Christos Faloutsos, Sebastian...
ESWS
2005
Springer
15 years 5 months ago
RDFSculpt: Managing RDF Schemas Under Set-Like Semantics
The Semantic Web is an extension of the current Web in which information is given well-defined meaning to support effective data discovery and integration. The RDF framework is a...
Zoi Kaoudi, Theodore Dalamagas, Timos K. Sellis
COMPGEOM
2010
ACM
15 years 4 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
IPM
2006
184views more  IPM 2006»
14 years 11 months ago
How are we searching the World Wide Web? A comparison of nine search engine transaction logs
The Web and especially major Web search engines are essential tools in the quest to locate online information for many people. This paper reports results from research that examin...
Bernard J. Jansen, Amanda Spink
CORR
1999
Springer
116views Education» more  CORR 1999»
14 years 11 months ago
Efficient and Extensible Algorithms for Multi Query Optimization
Complex queries are becoming commonplace, with the growing use of decision support systems. These complex queries often have a lot of common sub-expressions, either within a singl...
Prasan Roy, S. Seshadri, S. Sudarshan, Siddhesh Bh...