Results 11 - 20 of 1,951

STING: A statistical information grid approach to spatial data mining

by Wei Wang, Jiong Yang, Richard Muntz , 1997
"... Spatial data mining, i.e., discovery of interesting characteristics and patterns that may implicitly exist in spatial databases, is a challenging task due to the huge amounts of spatial data and to the new conceptual nature of the problems which must account for spatial distance. Clustering and regi ..."
Abstract - Cited by 290 (10 self) - Add to MetaCart
Spatial data mining, i.e., discovery of interesting characteristics and patterns that may implicitly exist in spatial databases, is a challenging task due to the huge amounts of spatial data and to the new conceptual nature of the problems which must account for spatial distance. Clustering

Spatial SQL: A Query and Presentation Language

by Max J. Egenhofer - IEEE Transactions on Knowledge and Data Engineering , 1994
"... attention has been focused on spatial databases which combine conventional and spatially related data such as Geographic Information Systems, CAD/CAM, or VLSI. A language has been developed to query such spatial databases. It recognizes the significantly different requirements of spatial data handli ..."
Abstract - Cited by 166 (9 self) - Add to MetaCart
attention has been focused on spatial databases which combine conventional and spatially related data such as Geographic Information Systems, CAD/CAM, or VLSI. A language has been developed to query such spatial databases. It recognizes the significantly different requirements of spatial data

Query Optimization for XML

by Jason Mchugh, Jennifer Widom - In Proceedings of VLDB , 1999
"... XML is an emerging standard for data representation and exchange on the World-Wide Web. Due to the nature of information on the Web and the inherent flexibility of XML, we expect that much of the data encoded in XML will be semistructured:the data may be irregular or incomplete, and its structu ..."
Abstract - Cited by 208 (3 self) - Add to MetaCart
structure may change rapidly or unpredictably. This paper describes the query processor of Lore,aDBMS for XML-based data supporting an expressive query language. We focus primarily on Lore's cost-based query optimizer. While all of the usual problems associated with cost-based query optimization

On query languages for linear queries definable with polynomial constraints

by Luc Vandeurzen , Marc Gyssens, Dirk Van Gucht - IN LNCS 1118: PROC. OF THE SECOND INT. CONFERENCE ON PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING , 1996
"... It has been argued that the linear database model, in which semi-linear sets are the only geometric objects, is very suitable for most spatial database applications. For querying linear databases, the language FO + linear has been proposed. We present both negative and positive results regarding th ..."
Abstract - Cited by 5 (0 self) - Add to MetaCart
It has been argued that the linear database model, in which semi-linear sets are the only geometric objects, is very suitable for most spatial database applications. For querying linear databases, the language FO + linear has been proposed. We present both negative and positive results regarding

On the Expressiveness of Query Languages with Linear Constraints; Capturing Desirable Spatial Properties

by Foto Afrati, Theodore Andronikos, Theodore Kavalieros - In Proceedings of the Second International Workshop on Constraint Database Systems, CDB '97 , 1997
"... . We explore the expressive power of the query language of first order logic with linear constraints. Natural queries are shown to be expressible in this language in a non-trivial fashion. We further investigate the ability of the language to capture certain properties that seem desirable in spatial ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
. We explore the expressive power of the query language of first order logic with linear constraints. Natural queries are shown to be expressible in this language in a non-trivial fashion. We further investigate the ability of the language to capture certain properties that seem desirable

Spatial Database Querying with Logic Languages

by Jean-pierre Cheiney, Vincent Oria - In Proceedings of Fourth International Conference on Database Systems for Advanced Applications (DASFAA'95 , 1995
"... Several different data structures, generally grouped in Raster and Vectors representation models, are used to store images and all kinds of spatial data. One solution, for a spatial data manipulation language to be independent of the storage model, is to base the language on the spatial relations of ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
of objects (i.e. the positions of objects relative to each other). This paper proposes a logic intermediate language allowing a declarative querying. We show that this language can be easily computed by a procedural execution using a small set of operators. This language enables expression of direction

Semistructured data

by Peter Buneman , 1997
"... In semistructured data, the information that is normally as-sociated with a schema is contained within the data, which is sometimes called “self-describing”. In some forms of semi-structured data there is no separate schema, in others it exists but only places loose constraints on the data. Semi-str ..."
Abstract - Cited by 281 (0 self) - Add to MetaCart
between disparate databases. Third, even when dealing with structured data, it may be helpful to view it. as semistructured for the purposes of browsing. This tu-torial will cover a number of issues surrounding such data: finding a concise formulation, building a sufficiently expres-sive language

Dimensionality Reduction for Fast Similarity Search in Large Time Series Databases

by Eamonn Keogh, Kaushik Chakrabarti, Michael Pazzani, Sharad Mehrotra , 2000
"... The problem of similarity search in large time series databases has attracted much attention recently. It is a non-trivial problem because of the inherent high dimensionality of the data. The most promising solutions involve first performing dimensionality reduction on the data, and then indexing th ..."
Abstract - Cited by 240 (21 self) - Add to MetaCart
and to implement, it allows more flexible distance measures, including weighted Euclidean queries, and the index can be built in linear time.

Interpreting the data: Parallel analysis with Sawzall.

by Rob Pike , Sean Dorward , Robert Griesemer , Sean Quinlan - Scientific Programming Journal, , 2005
"... Abstract Very large data sets often have a flat but regular structure and span multiple disks and machines. Examples include telephone call records, network logs, and web document repositories. These large data sets are not amenable to study using traditional database techniques, if only because th ..."
Abstract - Cited by 273 (0 self) - Add to MetaCart
, in which a query is expressed using a new procedural programming language, emits data to an aggregation phase. Both phases are distributed over hundreds or even thousands of computers. The results are then collated and saved to a file. The design -including the separation into two phases, the form

LINEARIZATION AND COMPLETENESS RESULTS FOR TERMINATING TRANSITIVE CLOSURE QUERIES ON SPATIAL DATABASES

by Floris Geerts, Bart Kuijpers, Jan Van Den Bussche , 2006
"... We study queries to spatial databases, where spatial data are modeled as semialgebraic sets, using the relational calculus with polynomial inequalities as a basic query language. We work with the extension of the relational calculus with terminating transitive closures. The main result is that this ..."
Abstract - Add to MetaCart
is that this language can express the linearization of semialgebraic databases. We also show that the sublanguage with linear inequalities only can express all computable queries on semilinear databases. As a consequence of these results, we obtain a completeness result for topological queries on semialgebraic
Results 11 - 20 of 1,951