Sciweavers

707 search results - page 25 / 142
» Processing queries on tree-structured data efficiently
Sort
View
SIGMOD
2010
ACM
149views Database» more  SIGMOD 2010»
13 years 3 months ago
On models and query languages for probabilistic processes
Probabilistic processes appear naturally in various contexts, with applications to Business Processes, XML data management and more. Many models for specifying and querying such p...
Daniel Deutch, Tova Milo
ISPAN
2002
IEEE
14 years 1 months ago
Parallel Selection Query Processing Involving Index in Parallel Database Systems
Index is an important element in databases, and the existence of index is unavoidable. When an index has been built on a particular attribute, database operations (e.g. selection,...
J. Wenny Rahayu, David Taniar
CORR
2006
Springer
125views Education» more  CORR 2006»
13 years 8 months ago
10^(10^6) Worlds and Beyond: Efficient Representation and Processing of Incomplete Information
We present a decomposition-based approach to managing probabilistic information. We introduce world-set decompositions (WSDs), a space-efficient and complete representation system ...
Lyublena Antova, Christoph Koch, Dan Olteanu
DEXAW
2004
IEEE
181views Database» more  DEXAW 2004»
14 years 10 days ago
Algebraic Optimization of Data Delivery Patterns in Mobile Sensor Networks
Database-like query processing over a network of sensors has become an attractive paradigm for building sensor applications. A sensor query is characterized by data streams among ...
Vladimir Zadorozhny, Panos K. Chrysanthis, Alexand...
SIGMOD
2004
ACM
199views Database» more  SIGMOD 2004»
14 years 8 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....