Sciweavers

921 search results - page 72 / 185
» New Data Structures for Orthogonal Range Searching
Sort
View
SIGMOD
1999
ACM
183views Database» more  SIGMOD 1999»
15 years 8 months ago
OPTICS: Ordering Points To Identify the Clustering Structure
Cluster analysis is a primary method for database mining. It is either used as a stand-alone tool to get insight into the distribution of a data set, e.g. to focus further analysi...
Mihael Ankerst, Markus M. Breunig, Hans-Peter Krie...
VLDB
2003
ACM
147views Database» more  VLDB 2003»
16 years 4 months ago
RE-tree: an efficient index structure for regular expressions
Due to their expressive power, Regular Expressions (REs) are quickly becoming an integral part of language specifications for several important application scenarios. Many of thes...
Chee Yong Chan, Minos N. Garofalakis, Rajeev Rasto...
VLDB
2007
ACM
126views Database» more  VLDB 2007»
16 years 4 months ago
Querying Complex Structured Databases
Correctly generating a structured query (e.g., an XQuery or a SQL query) requires the user to have a full understanding of the database schema, which can be a daunting task. Alter...
Cong Yu, H. V. Jagadish
EDBT
2004
ACM
131views Database» more  EDBT 2004»
16 years 4 months ago
A Framework for Access Methods for Versioned Data
This paper presents a framework for understanding and constructing access methods for versioned data. Records are associated with version ranges in a version tree. A minimal repre...
Betty Salzberg, Linan Jiang, David B. Lomet, Manue...
SIGMOD
2009
ACM
155views Database» more  SIGMOD 2009»
16 years 4 months ago
Efficient top-k algorithms for fuzzy search in string collections
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
Rares Vernica, Chen Li