Sciweavers

517 search results - page 51 / 104
» Computing Fuzzy Answer Sets Using dlvhex
Sort
View
ICDT
1995
ACM
79views Database» more  ICDT 1995»
14 years 2 months ago
Optimization Using Tuple Subsumption
A tuple t1 of relation R subsumes tuple t2 of R, with respect to a query Q if for every database, tuple t1 derives all, and possibly more, answers to query Q than derived by tuple ...
Venky Harinarayan, Ashish Gupta
PPDP
2010
Springer
13 years 9 months ago
Precise complexity analysis for efficient datalog queries
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
K. Tuncay Tekle, Yanhong A. Liu
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
14 years 11 months ago
Sharing aggregate computation for distributed queries
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
Ryan Huebsch, Minos N. Garofalakis, Joseph M. Hell...
ICPR
2008
IEEE
14 years 5 months ago
A robust technique for text extraction in mixed-type binary documents
A crucial preprocessing stage in applications such as OCR is text extraction from mixed-type documents. The present work, in contrast to most until now, successfully faces the pro...
Charalambos Strouthopoulos, Athanasios Nikolaidis
PODS
2010
ACM
306views Database» more  PODS 2010»
14 years 4 months ago
Optimizing linear counting queries under differential privacy
Differential privacy is a robust privacy standard that has been successfully applied to a range of data analysis tasks. But despite much recent work, optimal strategies for answe...
Chao Li, Michael Hay, Vibhor Rastogi, Gerome Mikla...