Sciweavers

274 search results - page 30 / 55
» Computational complexity of queries based on itemsets
Sort
View
121
Voted
CORR
2011
Springer
207views Education» more  CORR 2011»
14 years 7 months ago
DB Category: Denotational Semantics for View-based Database Mappings
Abstract. We present a categorical denotational semantics for a database mapping, based on views, in the most general framework of a database integration/exchange. Developed databa...
Zoran Majkic
EDBT
2010
ACM
177views Database» more  EDBT 2010»
15 years 2 months ago
PerK: personalized keyword search in relational databases through preferences
Keyword-based search in relational databases allows users to discover relevant information without knowing the database schema or using complicated queries. However, such searches...
Kostas Stefanidis, Marina Drosou, Evaggelia Pitour...
155
Voted
AAAI
2011
14 years 14 days ago
Markov Logic Sets: Towards Lifted Information Retrieval Using PageRank and Label Propagation
Inspired by “GoogleTM Sets” and Bayesian sets, we consider the problem of retrieving complex objects and relations among them, i.e., ground atoms from a logical concept, given...
Marion Neumann, Babak Ahmadi, Kristian Kersting
DOLAP
1999
ACM
15 years 4 months ago
Aggregation Everywhere: Data Reduction and Transformation in the Phoenix Data Warehouse
This paper describes the Phoenix system, which loads a data warehouse and then reports against it. Between the raw atomic data of the source system and the business measures prese...
Steven Tolkin
STOC
2004
ACM
142views Algorithms» more  STOC 2004»
16 years 23 days ago
Lower bounds for local search by quantum arguments
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
Scott Aaronson