Efficient Algorithms for Processing XPath Queries

ACM Transactions on Database Systems- United States

doi 10.1145/1071610.1071614

Full Text

Abstract

Available in

Date

Authors

Publisher

Association for Computing Machinery (ACM)

Related search

XPlainer: Visual Explanations of XPath Queries

2007English

Taming XPath Queries by Minimizing Wildcard Steps

2004English

Rewriting Regular XPath Queries on XML Views

2007English

Efficient Processing of Category-Restricted Queries for Web Directories

English

Processing Imprecise Database Queries by Fuzzy Clustering Algorithms

2015English

Efficient Processing of Top-K Spatial Preference Queries

Proceedings of the VLDB Endowment
Computer Science
2010English

Efficient Processing of Top-K Spatial Keyword Queries

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

An Efficient Bottom-Up Filtering of XML Messages by Exploiting the Postfix Commonality of XPath Queries

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2008English

An Efficient Sampling Scheme for Approximate Processing of Decision Support Queries

2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy