Sciweavers

765 search results - page 9 / 153
» Query Processing over Incomplete Autonomous Databases
Sort
View
SIGMOD
2011
ACM
249views Database» more  SIGMOD 2011»
14 years 21 days ago
ProApproX: a lightweight approximation query processor over probabilistic trees
We demonstrate a system for querying probabilistic XML documents with simple XPath queries. A user chooses between a variety of query answering techniques, both exact and approxim...
Pierre Senellart, Asma Souihli
ICDE
2009
IEEE
129views Database» more  ICDE 2009»
15 years 11 months ago
Evaluating TOP-K Queries over Business Processes
A Business Process (BP) consists of some business activities undertaken by one or more organizations in pursuit of some business goal. Tools for querying and analyzing BP specifica...
Daniel Deutch, Tova Milo
WAIM
2004
Springer
15 years 3 months ago
Learning-Based Top-N Selection Query Evaluation over Relational Databases
A top-N selection query against a relation is to find the N tuples that satisfy the query condition the best but not necessarily completely. In this paper, we propose a new method ...
Liang Zhu, Weiyi Meng
ICDE
2008
IEEE
127views Database» more  ICDE 2008»
15 years 11 months ago
Optimizing SQL Queries over Text Databases
Text documents often embed data that is structured in nature, and we can expose this structured data using information extraction technology. By processing a text database with inf...
Alpa Jain, AnHai Doan, Luis Gravano
SIGMOD
2011
ACM
176views Database» more  SIGMOD 2011»
14 years 21 days ago
Sharing work in keyword search over databases
An important means of allowing non-expert end-users to pose ad hoc queries — whether over single databases or data integration systems — is through keyword search. Given a set...
Marie Jacob, Zachary G. Ives