Sciweavers

2859 search results - page 84 / 572
» Querying Complex Structured Databases
Sort
View
SIGMOD
2007
ACM
160views Database» more  SIGMOD 2007»
14 years 8 months ago
Cayuga: a high-performance event processing engine
We propose a demonstration of Cayuga, a complex event monitoring system for high speed data streams. Our demonstration will show Cayuga applied to monitoring Web feeds; the demo w...
Lars Brenna, Alan J. Demers, Johannes Gehrke, Ming...
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
14 years 2 months ago
SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
Dan Olteanu, Jiewen Huang, Christoph Koch
SIGMOD
2009
ACM
148views Database» more  SIGMOD 2009»
14 years 8 months ago
Combining keyword search and forms for ad hoc querying of databases
A common criticism of database systems is that they are hard to query for users uncomfortable with a formal query language. To address this problem, form-based interfaces and keyw...
Eric Chu, Akanksha Baid, Xiaoyong Chai, AnHai Doan...
ICDE
1998
IEEE
104views Database» more  ICDE 1998»
14 years 9 months ago
Representing and Querying Changes in Semistructured Data
Semistructured data may be irregular and incomplete and does not necessarily conform to a fixed schema. As with structured data, it is often desirable to maintain a history of cha...
Sudarshan S. Chawathe, Serge Abiteboul, Jennifer W...
PODS
2009
ACM
119views Database» more  PODS 2009»
14 years 8 months ago
Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
Ke Yi