Statistical synopses for graph-structured XML databases
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
A Hierarchy of Polynomial-Time Computable Simulations for Automata
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
An Efficient and Scalable Algorithm for Clustering XML Documents by Structure
IEEE Transactions on Knowledge and Data Engineering
PRIX: Indexing And Querying XML Using Prüfer Sequences
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Multiresolution Indexing of XML for Frequent Queries
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Graph indexing: a frequent structure-based approach
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Twig query processing over graph-structured XML data
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
Ctree: a compact tree for indexing XML data
Proceedings of the 6th annual ACM international workshop on Web information and data management
A partition index for XML and semi-structured data
Data & Knowledge Engineering
On boosting holism in XML twig pattern matching using structural indexing techniques
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Indexing Useful Structural Patterns for XML Query Processing
IEEE Transactions on Knowledge and Data Engineering
Benefits of path summaries in an XML query optimizer supporting multiple access methods
VLDB '05 Proceedings of the 31st international conference on Very large data bases
An adaptive path index for XML data using the query workload
Information Systems
Accelerating queries by pruning XML documents
Data & Knowledge Engineering
Sequencing XML data and query twigs for fast pattern matching
ACM Transactions on Database Systems (TODS)
Exploit sequencing to accelerate hot XML query pattern mining
Proceedings of the 2006 ACM symposium on Applied computing
Structural characterizations of the semantics of XPath as navigation tool on a document
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Indexing graph-structured XML data for efficient structural join operation
Data & Knowledge Engineering
FIX: feature-based indexing technique for XML documents
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
XSKETCH synopses for XML data graphs
ACM Transactions on Database Systems (TODS)
Heuristic containment check of partial tree-pattern queries in the presence of index graphs
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Efficient processing of XPath queries using indexes
Information Systems
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Efficient structural joins on indexed XML documents
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Structure and value synopses for XML data graphs
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Efficiently Querying Large XML Data Repositories: A Survey
IEEE Transactions on Knowledge and Data Engineering
Indexing temporal XML documents
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Assigning semantics to partial tree-pattern queries
Data & Knowledge Engineering
Enabling structural summaries for efficient update and workload adaptation
Data & Knowledge Engineering
XML twig pattern matching using version tree
Data & Knowledge Engineering
Efficient mining of frequent closed XML query pattern
Journal of Computer Science and Technology
Graph summarization with bounded error
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Track: a novel XML join algorithm for efficient processing twig queries
ADC '08 Proceedings of the nineteenth conference on Australasian database - Volume 75
Temporal XML: modeling, indexing, and query processing
The VLDB Journal — The International Journal on Very Large Data Bases
Warehousing complex data from the web
International Journal of Web Engineering and Technology
Pattern based processing of XPath queries
IDEAS '08 Proceedings of the 2008 international symposium on Database engineering & applications
RRSi: indexing XML data for proximity twig queries
Knowledge and Information Systems
X-Binder: Path Combining System of XML Documents Based on RDBMS
KES-AMSTA '07 Proceedings of the 1st KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications
Proceedings of the 14th international conference on Intelligent user interfaces
Incremental sequence-based frequent query pattern mining from XML queries
Data Mining and Knowledge Discovery
Containment of partially specified tree-pattern queries in the presence of dimension graphs
The VLDB Journal — The International Journal on Very Large Data Bases
Semantic Search --- Using Graph-Structured Semantic Models for Supporting the Search Process
ICCS '09 Proceedings of the 17th International Conference on Conceptual Structures: Conceptual Structures: Leveraging Semantic Technologies
A bi-labeling based XPath processing system
Information Systems
An adaptive path index for XML data using the query workload
Information Systems
Xbase: cloud-enabled information appliance for healthcare
Proceedings of the 13th International Conference on Extending Database Technology
Efficient evaluation in XML to XML transformations
APWeb'03 Proceedings of the 5th Asia-Pacific web conference on Web technologies and applications
Specifying and optimising XML views
BNCOD'07 Proceedings of the 24th British national conference on Databases
Effective pruning for XML structural match queries
Data & Knowledge Engineering
Exploring XML web collections with DescribeX
ACM Transactions on the Web (TWEB)
Data sources selection for XML data sources
International Journal of Intelligent Information and Database Systems
MARGIN: Maximal frequent subgraph mining
ACM Transactions on Knowledge Discovery from Data (TKDD)
LTIX: a compact level-based tree to index XML databases
Proceedings of the Fourteenth International Database Engineering & Applications Symposium
XSym'10 Proceedings of the 7th international XML database conference on Database and XML technologies
Indexing and querying XML using extended Dewey labeling scheme
Data & Knowledge Engineering
LLS: level-based labeling scheme for XML databases
Proceedings of the 2010 Conference of the Center for Advanced Studies on Collaborative Research
Key concepts for native XML processing
From active data management to event-based systems and more
Database and information retrieval techniques for XML
ASIAN'05 Proceedings of the 10th Asian Computing Science conference on Advances in computer science: data management on the web
Practical indexing XML Document For Twig query
ASIAN'05 Proceedings of the 10th Asian Computing Science conference on Advances in computer science: data management on the web
Evaluating interconnection relationship for path-based XML retrieval
WISE'06 Proceedings of the 7th international conference on Web Information Systems
Adaptively indexing dynamic XML
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
SIOUX: an efficient index for processing structural XQueries
DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
HID: an efficient path index for complex XML collections with arbitrary links
DNIS'05 Proceedings of the 4th international conference on Databases in Networked Information Systems
Relational index support for XPath axes
XSym'05 Proceedings of the Third international conference on Database and XML Technologies
A resource efficient hybrid data structure for twig queries
XSym'06 Proceedings of the 4th international conference on Database and XML Technologies
Efficient external-memory bisimulation on DAGs
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
OXDP & OXiP: the notion of objects for efficient large XML data queries
International Journal of Grid and Utility Computing
Fast answering of XPath query workloads on web collections
XSym'07 Proceedings of the 5th international conference on Database and XML Technologies
SchemEX - Efficient construction of a data catalogue by stream-based indexing of linked data
Web Semantics: Science, Services and Agents on the World Wide Web
Energy and Latency Efficient Access of Wireless XML Stream
Journal of Database Management
Optimizing XML queries: Bitmapped materialized views vs. indexes
Information Systems
Regularities and dynamics in bisimulation reductions of big graphs
First International Workshop on Graph Data Management Experiences and Systems
CIS-X: A compacted indexing scheme for efficient query evaluation of XML documents
Information Sciences: an International Journal
External memory K-bisimulation reduction of big graphs
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Efficiency and precision trade-offs in graph summary algorithms
Proceedings of the 17th International Database Engineering & Applications Symposium
Bisimulation reduction of big graphs on mapreduce
BNCOD'13 Proceedings of the 29th British National conference on Big Data
Summarizing answer graphs induced by keyword queries
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
XML and other semi-structured data may have partially specified or missing schema information, motivating the use of a structural summary which can be automatically computed from the data. These summaries also serve as indices for evaluating the complex path expressions common to XML and semi-structured query languages. However, to answer all path queries accurately, summaries must encode information about long, seldom-queried paths, leading to increased size and complexity with little added value. We introduce the A(k)-indices, a family of approximate structural summaries. They are based on the concept of k-bisimilarity, in which nodes are grouped based on local structure, i.e., the incoming paths of length up to k. The parameter k thus smoothly varies the level of detail (and accuracy) of the A(k)-index. For small values of k, the size of the index is substantially reduced. While smaller, the A(k) index is approximate, and we describe techniques for efficiently extracting exact answers to regular path queries. Our experiments show that, for moderate values of k, path evaluation using the A(k)-index ranges from being very efficient for simple queries to competitive for most complex queries, while using significantly less space than comparable structures.