Sciweavers

493 search results - page 28 / 99
» Consensus answers for queries over probabilistic databases
Sort
View
ER
2010
Springer
164views Database» more  ER 2010»
14 years 9 months ago
Querying Databases with Taxonomies
Traditional information search in which queries are posed against a known and rigid schema over a structured database is shifting towards a Web scenario in which exposed schemas ar...
Davide Martinenghi, Riccardo Torlone
SIGMOD
2004
ACM
199views Database» more  SIGMOD 2004»
15 years 11 months ago
Approximate XML Query Answers
The rapid adoption of XML as the standard for data representation and exchange foreshadows a massive increase in the amounts of XML data collected, maintained, and queried over th...
Neoklis Polyzotis, Minos N. Garofalakis, Yannis E....
ICLP
2010
Springer
15 years 3 months ago
Tabling and Answer Subsumption for Reasoning on Logic Programs with Annotated Disjunctions
Probabilistic Logic Programming is an active field of research, with many proposals for languages, semantics and reasoning algorithms. One such proposal, Logic Programming with A...
Fabrizio Riguzzi, Terrance Swift
PVLDB
2010
98views more  PVLDB 2010»
14 years 9 months ago
On-the-Fly Entity-Aware Query Processing in the Presence of Linkage
Entity linkage is central to almost every data integration and data cleaning scenario. Traditional techniques use some computed similarity among data structure to perform merges a...
Ekaterini Ioannou, Wolfgang Nejdl, Claudia Nieder&...
ICDE
2008
IEEE
194views Database» more  ICDE 2008»
16 years 13 days ago
P-Cube: Answering Preference Queries in Multi-Dimensional Space
Many new applications that involve decision making need online (i.e., OLAP-styled) preference analysis with multidimensional boolean selections. Typical preference queries includes...
Dong Xin, Jiawei Han