Sciweavers

69 search results - page 8 / 14
» A new way of optimizing OLAP queries
Sort
View
SIGMOD
2000
ACM
99views Database» more  SIGMOD 2000»
14 years 28 days ago
WSQ/DSQ: A Practical Approach for Combined Querying of Databases and the Web
We present WSQ/DSQ (pronounced “wisk-disk”), a new approach for combining the query facilities of traditional databases with existing search engines on the Web. WSQ, for Web-S...
Roy Goldman, Jennifer Widom
ICDE
2008
IEEE
395views Database» more  ICDE 2008»
15 years 8 months ago
PermJoin: An Efficient Algorithm for Producing Early Results in Multi-join Query Plans
This paper introduces an efficient algorithm for Producing Early Results in Multi-join query plans (PermJoin, for short). While most previous research focuses only on the case of ...
Justin J. Levandoski, Mohamed E. Khalefa, Mohamed ...
BDA
2003
13 years 10 months ago
Memory Requirements for Query Execution in Highly Constrained Devices
Pervasive computing introduces data management requirements that must be tackled in a growingvariety of lightweight computing devices. Personal folders on chip, networks of sensor...
Nicolas Anciaux, Luc Bouganim, Philippe Pucheral
EDBT
2002
ACM
246views Database» more  EDBT 2002»
14 years 8 months ago
Impact and Potential of User Profiles Used for Distributed Query Processing Based on Literature Services
Applying meta search systems is a suitable method to support the user if there are many different services. Due to information splitting strategies of literature services existing ...
Bethina Schmitt
ICLP
2010
Springer
14 years 14 days ago
Implementation Alternatives for Bottom-Up Evaluation
Abstract. Bottom-up evaluation is a central part of query evaluation / program execution in deductive databases. It is used after a source code optimization like magic sets or SLDm...
Stefan Brass