Sciweavers

2629 search results - page 295 / 526
» complex 2009
Sort
View
SIGSOFT
2009
ACM
16 years 5 months ago
Engineering search computing applications: vision and challenges
Search computing is a novel discipline whose goal is to answer complex, multi-domain queries. Such queries typically require combining in their results domain knowledge extracted ...
Marco Brambilla, Stefano Ceri
ICDT
2009
ACM
105views Database» more  ICDT 2009»
16 years 5 months ago
Efficient data structures for range-aggregate queries on trees
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
Hao Yuan, Mikhail J. Atallah
ICDT
2009
ACM
109views Database» more  ICDT 2009»
16 years 5 months ago
TOP-K projection queries for probabilistic 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 specific...
Daniel Deutch, Tova Milo
ICDT
2009
ACM
173views Database» more  ICDT 2009»
16 years 5 months ago
Containment of conjunctive queries on annotated relations
We study containment and equivalence of (unions of) conjunctive queries on relations annotated with elements of a commutative semiring. Such relations and the semantics of positiv...
Todd J. Green
ICDT
2009
ACM
121views Database» more  ICDT 2009»
16 years 5 months ago
Optimal splitters for database partitioning with size bounds
Partitioning is an important step in several database algorithms, including sorting, aggregation, and joins. Partitioning is also fundamental for dividing work into equal-sized (o...
Kenneth A. Ross, John Cieslewicz