Sciweavers

173 search results - page 23 / 35
» Range queries in dynamic OLAP data cubes
Sort
View
DEBU
2000
147views more  DEBU 2000»
13 years 7 months ago
Adaptive Query Processing for Internet Applications
As the area of data management for the Internet has gained in popularity, recent work has focused on effectively dealing with unpredictable, dynamic data volumes and transfer rate...
Zachary G. Ives, Alon Y. Levy, Daniel S. Weld, Dan...
VLDB
2004
ACM
119views Database» more  VLDB 2004»
14 years 7 months ago
Evaluating holistic aggregators efficiently for very large datasets
Indatawarehousingapplications,numerousOLAP queries involve the processing of holistic aggregators such as computing the "top n," median, quantiles, etc. In this paper, we...
Lixin Fu, Sanguthevar Rajasekaran
MICRO
2008
IEEE
146views Hardware» more  MICRO 2008»
13 years 7 months ago
A small cache of large ranges: Hardware methods for efficiently searching, storing, and updating big dataflow tags
Dynamically tracking the flow of data within a microprocessor creates many new opportunities to detect and track malicious or erroneous behavior, but these schemes all rely on the...
Mohit Tiwari, Banit Agrawal, Shashidhar Mysore, Jo...
SISAP
2009
IEEE
159views Data Mining» more  SISAP 2009»
14 years 2 months ago
Dynamic P2P Indexing and Search Based on Compact Clustering
Abstract—We propose a strategy to perform query processing on P2P similarity search systems based on peers and superpeers. We show that by approximating global but resumed inform...
Mauricio Marín, Veronica Gil Costa, Cecilia...
ADL
2000
Springer
251views Digital Library» more  ADL 2000»
13 years 12 months ago
Efficient Similarity Search in Digital Libraries
Digital libraries are a core information technology. When the stored data is complex, e.g. high-resolution images or molecular protein structures, simple query types like the exac...
Christian Böhm, Bernhard Braunmüller, Ha...