Sciweavers

6274 search results - page 38 / 1255
» From query complexity to computational complexity
Sort
View
ICDE
2002
IEEE
206views Database» more  ICDE 2002»
14 years 11 months ago
Exploiting Local Similarity for Indexing Paths in Graph-Structured Data
XML and other semi-structured data may have partially specified or missing schema information, motivating the use of a structural summary which can be automatically computed from ...
Raghav Kaushik, Pradeep Shenoy, Philip Bohannon, E...
ICALP
1992
Springer
14 years 2 months ago
Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine
Abstract Bernard Chazelle Department of Computer Science Princeton University Burton Rosenberg Department of Mathematics and Computer Science Dartmouth College We give a lower bou...
Bernard Chazelle, Burton Rosenberg
DAWAK
2011
Springer
12 years 9 months ago
OLAP Formulations for Supporting Complex Spatial Objects in Data Warehouses
In recent years, there has been a large increase in the amount of spatial data obtained from remote sensing, GPS receivers, communication terminals and other domains. Data warehous...
Ganesh Viswanathan, Markus Schneider
VLDB
2007
ACM
137views Database» more  VLDB 2007»
14 years 4 months ago
Detecting Attribute Dependencies from Query Feedback
Real-world datasets exhibit a complex dependency structure among the data attributes. Learning this structure is a key task in automatic statistics configuration for query optimi...
Peter J. Haas, Fabian Hueske, Volker Markl
ICDE
1996
IEEE
103views Database» more  ICDE 1996»
14 years 11 months ago
Using Partial Differencing for Efficient Monitoring of Deferred Complex Rule Conditions
This paper presents a difference calculus for determining changes to rule conditions in an active DBMS. The calculus has been used for implementing an algorithm to efficiently mon...
Martin Sköld, Tore Risch