Sciweavers

112 search results - page 15 / 23
» Succinct Data Structures for Retrieval and Approximate Membe...
Sort
View
177
Voted
VLDB
2003
ACM
147views Database» more  VLDB 2003»
15 years 10 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...
KDD
2004
ACM
168views Data Mining» more  KDD 2004»
15 years 10 months ago
Mining, indexing, and querying historical spatiotemporal data
In many applications that track and analyze spatiotemporal data, movements obey periodic patterns; the objects follow the same routes (approximately) over regular time intervals. ...
Nikos Mamoulis, Huiping Cao, George Kollios, Mario...
ICWE
2010
Springer
15 years 2 months ago
Ranking the Linked Data: The Case of DBpedia
The recent proliferation of crowd computing initiatives on the web calls for smarter methodologies and tools to annotate, query and explore repositories. There is the need for scal...
Roberto Mirizzi, Azzurra Ragone, Tommaso Di Noia, ...
SIGMOD
2001
ACM
184views Database» more  SIGMOD 2001»
15 years 10 months ago
Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
Eamonn J. Keogh, Kaushik Chakrabarti, Sharad Mehro...
IRI
2006
IEEE
15 years 4 months ago
Replacing full rectangles by dense rectangles: Concept lattices and attribute implications
— Maximal full rectangles in tabular data are useful in several areas of data engineering. This paper presents a survey of results in which we replace “full rectangles” by ...
Radim Belohlávek, Vilém Vychodil