Sciweavers

10419 search results - page 1883 / 2084
» Relational information gain
Sort
View
POPL
2008
ACM
16 years 7 months ago
Generating precise and concise procedure summaries
We present a framework for generating procedure summaries that are precise -- applying the summary in a given context yields the same result as re-analyzing the procedure in that ...
Greta Yorsh, Eran Yahav, Satish Chandra
POPL
2007
ACM
16 years 7 months ago
Preferential path profiling: compactly numbering interesting paths
Path profiles provide a more accurate characterization of a program's dynamic behavior than basic block or edge profiles, but are relatively more expensive to collect. This h...
Kapil Vaswani, Aditya V. Nori, Trishul M. Chilimbi
VLDB
2008
ACM
110views Database» more  VLDB 2008»
16 years 6 months ago
Enhancing histograms by tree-like bucket indices
Histograms are used to summarize the contents of relations into a number of buckets for the estimation of query result sizes. Several techniques (e.g., MaxDiff and V-Optimal) have ...
Francesco Buccafurri, Gianluca Lax, Domenico SaccÃ...
SIGMOD
2006
ACM
232views Database» more  SIGMOD 2006»
16 years 6 months ago
To search or to crawl?: towards a query optimizer for text-centric tasks
Text is ubiquitous and, not surprisingly, many important applications rely on textual data for a variety of tasks. As a notable example, information extraction applications derive...
Panagiotis G. Ipeirotis, Eugene Agichtein, Pranay ...
178
Voted
SIGMOD
2003
ACM
166views Database» more  SIGMOD 2003»
16 years 6 months ago
Statistical Schema Matching across Web Query Interfaces
Schema matching is a critical problem for integrating heterogeneous information sources. Traditionally, the problem of matching multiple schemas has essentially relied on finding ...
Bin He, Kevin Chen-Chuan Chang
« Prev « First page 1883 / 2084 Last » Next »