Sciweavers

958 search results - page 36 / 192
» Efficient data structures for range-aggregate queries on tre...
Sort
View
DATESO
2004
174views Database» more  DATESO 2004»
15 years 1 months ago
On Efficient Part-match Querying of XML Data
The XML language have been becoming de-facto a standard for representation of heterogeneous data in the Internet. From database point of view, XML is a new approach to data modelli...
Michal Krátký, Marek Andrt
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
13 years 2 months ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray
ICDM
2006
IEEE
132views Data Mining» more  ICDM 2006»
15 years 6 months ago
Mining for Tree-Query Associations in a Graph
New applications of data mining, such as in biology, bioinformatics, or sociology, are faced with large datasets structured as graphs. We present an efficient algorithm for minin...
Eveline Hoekx, Jan Van den Bussche
139
Voted
WWW
2010
ACM
14 years 10 months ago
Evaluation Techniques for Generalized Path Pattern Queries on XML Data
Finding the occurrences of structural patterns in XML data is a key operation in XML query processing. Existing algorithms for this operation focus almost exclusively on path patt...
Xiaoying Wu, Dimitri Theodoratos, Stefanos Souldat...
121
Voted
ICDE
2010
IEEE
249views Database» more  ICDE 2010»
15 years 7 months ago
PARINET: A tunable access method for in-network trajectories
— In this paper we propose PARINET, a new access method to efficiently retrieve the trajectories of objects moving in networks. The structure of PARINET is based on a combination...
Iulian Sandu Popa, Karine Zeitouni, Vincent Oria, ...