Sciweavers

4468 search results - page 276 / 894
» Processing Forecasting Queries
Sort
View
SIGMOD
2006
ACM
138views Database» more  SIGMOD 2006»
16 years 6 months ago
B-tree indexes for high update rates
ct In some applications, data capture dominates query processing. For example, monitoring moving objects often requires more insertions and updates than queries. Data gathering usi...
Goetz Graefe
SSDBM
2008
IEEE
115views Database» more  SSDBM 2008»
16 years 1 months ago
Breaking the Curse of Cardinality on Bitmap Indexes
Bitmap indexes are known to be efficient for ad-hoc range queries that are common in data warehousing and scientific applications. However, they suffer from the curse of cardina...
Kesheng Wu, Kurt Stockinger, Arie Shoshani
OTM
2005
Springer
16 years 4 days ago
On the Usage of Global Document Occurrences in Peer-to-Peer Information Systems
There exist a number of approaches for query processing in Peer-to-Peer information systems that efficiently retrieve relevant information from distributed peers. However, very few...
Odysseas Papapetrou, Sebastian Michel, Matthias Be...
164
Voted
SIGMOD
2010
ACM
188views Database» more  SIGMOD 2010»
15 years 11 months ago
A demonstration of FlexPref: extensible preference evaluation inside the DBMS engine
This demonstration presents FlexPref, a framework implemented inside the DBMS query processor that enables efficient and extensible preference query processing. FlexPref provides ...
Justin J. Levandoski, Mohamed F. Mokbel, Mohamed E...
HPDC
2010
IEEE
15 years 7 months ago
New caching techniques for web search engines
This paper proposes a cache hierarchy that enables Web search engines to efficiently process user queries. The different caches in the hierarchy are used to store pieces of data w...
Mauricio Marín, Veronica Gil Costa, Carlos ...