Sciweavers

1998 search results - page 310 / 400
» Complexity of the Cover Polynomial
Sort
View
131
Voted
ICDT
2012
ACM
251views Database» more  ICDT 2012»
13 years 3 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
119
Voted
COCOA
2009
Springer
15 years 4 months ago
An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems
stract to be announcedPlenary session 09:00-10:00 Panos M, Pardalos, University of Florida, USA Tea Break 10:00-10:20 At the 1st floor 10:20-10:45 Polynomial Approximation Schemes ...
Jingfa Liu, Yonglei Yao, Yu Zheng, Huantong Geng, ...
178
Voted
VLDB
2007
ACM
103views Database» more  VLDB 2007»
16 years 27 days ago
On the Production of Anorexic Plan Diagrams
A "plan diagram" is a pictorial enumeration of the execution plan choices of a database query optimizer over the relational selectivity space. We have shown recently tha...
Harish D., Pooja N. Darera, Jayant R. Haritsa
120
Voted
EDBT
2009
ACM
166views Database» more  EDBT 2009»
15 years 5 months ago
Neighbor-based pattern detection for windows over streaming data
The discovery of complex patterns such as clusters, outliers, and associations from huge volumes of streaming data has been recognized as critical for many domains. However, patte...
Di Yang, Elke A. Rundensteiner, Matthew O. Ward
SIGMOD
1997
ACM
107views Database» more  SIGMOD 1997»
15 years 4 months ago
Range Queries in OLAP Data Cubes
A range query applies an aggregation operation over all selected cells of an OLAP data cube where the selection is speci ed by providing ranges of values for numeric dimensions. W...
Ching-Tien Ho, Rakesh Agrawal, Nimrod Megiddo, Ram...