Sciweavers

511 search results - page 47 / 103
» Approximate Selection Queries over Imprecise Data
Sort
View
DPD
2006
114views more  DPD 2006»
15 years 6 months ago
A novel approach to resource scheduling for parallel query processing on computational grids
Advances in network technologies and the emergence of Grid computing have both increased the need and provided the infrastructure for computation and data intensive applications to...
Anastasios Gounaris, Rizos Sakellariou, Norman W. ...
146
Voted
VL
2002
IEEE
15 years 11 months ago
A Visual Query Language for Software Visualization
Visualization for software understanding requires that the user be able to define specific visualizations that are specialized to the particular understanding task at hand. In t...
Steven P. Reiss
APWEB
2004
Springer
15 years 11 months ago
Using Relational Database Constraints to Design Materialized Views in Data Warehouses
Queries to data warehouses often involve hundreds of complex aggregations over large volumes of data, and so it is infeasible to compute these queries by scanning the data sources ...
Taehee Lee, Jae-young Chang, Sang-goo Lee
ICDM
2007
IEEE
99views Data Mining» more  ICDM 2007»
16 years 12 days ago
Optimizing Frequency Queries for Data Mining Applications
Data mining algorithms use various Trie and bitmap-based representations to optimize the support (i.e., frequency) counting performance. In this paper, we compare the memory requi...
Hassan H. Malik, John R. Kender
WSDM
2012
ACM
207views Data Mining» more  WSDM 2012»
14 years 1 months ago
Sequence clustering and labeling for unsupervised query intent discovery
One popular form of semantic search observed in several modern search engines is to recognize query patterns that trigger instant answers or domain-specific search, producing sem...
Jackie Chi Kit Cheung, Xiao Li