Sciweavers

451 search results - page 72 / 91
» Identifying Facts for TCBR
Sort
View
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
14 years 7 months ago
Robust and efficient algorithms for rank join evaluation
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
Jonathan Finger, Neoklis Polyzotis
SIGMOD
2009
ACM
132views Database» more  SIGMOD 2009»
14 years 7 months ago
Core schema mappings
Research has investigated mappings among data sources under two perspectives. On one side, there are studies of practical tools for schema mapping generation; these focus on algor...
Giansalvatore Mecca, Paolo Papotti, Salvatore Raun...
SIGMOD
2008
ACM
193views Database» more  SIGMOD 2008»
14 years 7 months ago
ARCube: supporting ranking aggregate queries in partially materialized data cubes
Supporting ranking queries in database systems has been a popular research topic recently. However, there is a lack of study on supporting ranking queries in data warehouses where...
Tianyi Wu, Dong Xin, Jiawei Han
SIGMOD
2006
ACM
232views Database» more  SIGMOD 2006»
14 years 7 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 ...
ICSE
2004
IEEE-ACM
14 years 7 months ago
Efficient Forward Computation of Dynamic Slices Using Reduced Ordered Binary Decision Diagrams
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. Recently algorithms for forwar...
Xiangyu Zhang, Rajiv Gupta, Youtao Zhang