Sciweavers

1552 search results - page 10 / 311
» Creating Database Queries by Demonstration
Sort
View
EDBT
2009
ACM
115views Database» more  EDBT 2009»
14 years 2 months ago
Top-k dominating queries in uncertain databases
Due to the existence of uncertain data in a wide spectrum of real applications, uncertain query processing has become increasingly important, which dramatically differs from handl...
Xiang Lian, Lei Chen 0002
ICDE
2006
IEEE
138views Database» more  ICDE 2006»
14 years 1 months ago
Toward a Query Language for Network Attack Data
The growing sophistication and diversity of malicious activity in the Internet presents a serious challenge for network security analysts. In this paper, we describe our efforts t...
Bee-Chung Chen, Vinod Yegneswaran, Paul Barford, R...
SIGMOD
2008
ACM
162views Database» more  SIGMOD 2008»
14 years 7 months ago
Event queries on correlated probabilistic streams
A major problem in detecting events in streams of data is that the data can be imprecise (e.g. RFID data). However, current state-ofthe-art event detection systems such as Cayuga ...
Christopher Ré, Dan Suciu, Julie Letchner, ...
VLDB
2002
ACM
108views Database» more  VLDB 2002»
13 years 7 months ago
Generic Database Cost Models for Hierarchical Memory Systems
Accurate prediction of operator execution time is a prerequisite for database query optimization. Although extensively studied for conventional disk-based DBMSs, cost modeling in ...
Stefan Manegold, Peter A. Boncz, Martin L. Kersten
SIGMOD
2011
ACM
249views Database» more  SIGMOD 2011»
12 years 10 months 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