Sciweavers

93 search results - page 13 / 19
» Efficient Table Anonymization for Aggregate Query Answering
Sort
View
SIGMOD
2001
ACM
136views Database» more  SIGMOD 2001»
15 years 11 months ago
Selectivity Estimation using Probabilistic Models
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
Lise Getoor, Benjamin Taskar, Daphne Koller
ICDE
2003
IEEE
148views Database» more  ICDE 2003»
16 years 1 months ago
Efficient Computation of Subqueries in Complex OLAP
Expressing complex OLAP queries using group-by, aggregation, and joins can be extremely difficult. As a result of this, many alternate ways of expressing such queries have been de...
Michael H. Böhlen, Michael O. Akinde
WWW
2006
ACM
16 years 9 days ago
Optimizing scoring functions and indexes for proximity search in type-annotated corpora
We introduce a new, powerful class of text proximity queries: find an instance of a given "answer type" (person, place, distance) near "selector" tokens matchi...
Soumen Chakrabarti, Kriti Puniyani, Sujatha Das
ICC
2007
IEEE
180views Communications» more  ICC 2007»
15 years 6 months ago
Distributed Quad-Tree for Spatial Querying in Wireless Sensor Networks
— In contrast to the traditional wireless sensor network (WSN) applications that perform only data collection and aggregation, new generation of information processing applicatio...
Murat Demirbas, Xuming Lu
VLDB
2007
ACM
182views Database» more  VLDB 2007»
15 years 5 months ago
Continuous Queries in Oracle
This paper describes Continuous Queries (CQ) in Oracle RDBMS, a feature that incorporates stream and complex event processing into an RDBMS, the first such attempt in commercial d...
Sankar Subramanian, Srikanth Bellamkonda, Hua-Gang...