Sciweavers

175 search results - page 18 / 35
» Faster Path Indexes for Search in XML Data
Sort
View
ICDE
2002
IEEE
181views Database» more  ICDE 2002»
14 years 16 days ago
YFilter: Efficient and Scalable Filtering of XML Documents
Soon, much of the data exchanged over the Internet will be encoded in XML, allowing for sophisticated filtering and content-based routing. We have built a filtering engine called ...
Yanlei Diao, Peter M. Fischer, Michael J. Franklin...
SIGMOD
2004
ACM
127views Database» more  SIGMOD 2004»
14 years 7 months ago
Efficient Query Reformulation in Peer-Data Management Systems
Peer data management systems (PDMS) offer a flexible architecture for decentralized data sharing. In a PDMS, every peer is associated with a schema that represents the peer's...
Igor Tatarinov, Alon Y. Halevy
DEXA
2009
Springer
222views Database» more  DEXA 2009»
14 years 2 months ago
On Index-Free Similarity Search in Metric Spaces
Metric access methods (MAMs) serve as a tool for speeding similarity queries. However, all MAMs developed so far are index-based; they need to build an index on a given database. T...
Tomás Skopal, Benjamin Bustos
SSDBM
1999
IEEE
124views Database» more  SSDBM 1999»
13 years 12 months ago
An Indexing Scheme for Fast Similarity Search in Large Time Series Databases
We address the problem of similarity search in large time series databases. We introduce a novel indexing algorithm that allows faster retrieval. The index is formed by creating b...
Eamonn J. Keogh, Michael J. Pazzani
ICML
2007
IEEE
14 years 8 months ago
Entire regularization paths for graph data
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
Koji Tsuda