Sciweavers

861 search results - page 69 / 173
» Relational Completeness of Query Languages for Annotated Dat...
Sort
View
147
Voted
EDBT
2010
ACM
177views Database» more  EDBT 2010»
15 years 10 months ago
Bridging the gap between intensional and extensional query evaluation in probabilistic databases
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...
Abhay Jha, Dan Olteanu, Dan Suciu
94
Voted
VLDB
1998
ACM
108views Database» more  VLDB 1998»
15 years 7 months ago
MindReader: Querying Databases Through Multiple Examples
Users often can not easily express their queries. For example, in a multimedia image by content setting, the user might want photographs with sunsets; in current systems, like QBI...
Yoshiharu Ishikawa, Ravishankar Subramanya, Christ...
164
Voted
SEBD
2001
145views Database» more  SEBD 2001»
15 years 5 months ago
Reasoning over Conceptual Schemas and Queries in Temporal Databases
This paper introduces a new logical formalism, intended for temporal conceptual modelling, as a natural combination of the well-known description logic DLR and point-based linear ...
Alessandro Artale, Enrico Franconi, Milenko Mosuro...
139
Voted
EDBT
2012
ACM
299views Database» more  EDBT 2012»
13 years 6 months ago
RecStore: an extensible and adaptive framework for online recommender queries inside the database engine
Most recommendation methods (e.g., collaborative filtering) consist of (1) a computationally intense offline phase that computes a recommender model based on users’ opinions o...
Justin J. Levandoski, Mohamed Sarwat, Mohamed F. M...
145
Voted
IDEAS
2008
IEEE
153views Database» more  IDEAS 2008»
15 years 10 months ago
Pattern based processing of XPath queries
As the popularity of areas including document storage and distributed systems continues to grow, the demand for high performance XML databases is increasingly evident. This has le...
Gerard Marks, Mark Roantree