On generating all maximal independent sets
Information Processing Letters
Graph minors. XIII: the disjoint paths problem
Journal of Combinatorial Theory Series B
Querying websites using compact skeletons
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Structural proximity searching for large collections of semi-structured data
Proceedings of the tenth international conference on Information and knowledge management
Generating Relations from XML Documents
ICDT '03 Proceedings of the 9th International Conference on Database Theory
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
DBXplorer: A System for Keyword-Based Search over Relational Databases
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Keyword Searching and Browsing in Databases using BANKS
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Discover: keyword search in relational databases
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
XSEarch: a semantic search engine for XML
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Efficiently enumerating results of keyword search
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
An algebraic query model for effective and efficient retrieval of XML fragments
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Keyword search on relational data streams
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Self-correcting queries for xml
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Effective keyword search for valuable lcas over xml documents
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Querying complex structured databases
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Efficiently enumerating results of keyword search over data graphs
Information Systems
Towards an integrated framework for querying collection of heterogeneous data
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
A coherent query language for XML
Journal of Intelligent Information Systems
MCN: A New Semantics Towards Effective XML Keyword Search
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
ExQueX: exploring and querying XML documents
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Keyword search over relational tables and streams
ACM Transactions on Database Systems (TODS)
A practical method for browsing a relational database using a standard search engine
Integrated Computer-Aided Engineering - Selected papers from the IEEE Conference on Information Reuse and Integration (IRI), July 13-15, 2008
SAIL: Structure-aware indexing for effective and progressive top-k keyword search over XML documents
Information Sciences: an International Journal
Information Systems
Information Systems
KSRQuerying: XML Keyword with Recursive Querying
XSym '09 Proceedings of the 6th International XML Database Symposium on Database and XML Technologies
Efficient keyword search over data-centric XML documents
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
OOXsearch: a search engine for answering loosely structured XML queries using OO programming
BNCOD'07 Proceedings of the 24th British national conference on Databases
Exploiting ID references for effective keyword search in XML documents
DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
BusSEngine: a business search engine
Knowledge and Information Systems
Finding a minimal tree pattern under neighborhood constraints
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
K-graphs: selecting top-k data sources for XML keyword queries
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I
Efficiently enumerating results of keyword search
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Top-K data source selection for keyword queries over multiple XML data sources
Journal of Information Science
On the effectiveness of flexible querying heuristics for XML data
XSym'07 Proceedings of the 5th international conference on Database and XML Technologies
Extracting minimum-weight tree patterns from a schema with neighborhood constraints
Proceedings of the 16th International Conference on Database Theory
Hi-index | 0.00 |
A framework for describing semantic relationships among nodes in XML documents is presented. In contrast to earlier work, the XML documents may have ID references (i.e., they correspond to graphs and not just trees). A specific interconnection semantics in this framework can be defined explicitly or derived automatically. The main advantage of interconnection semantics is the ability to pose queries on XML data in the style of keyword search. Several methods for automatically deriving interconnection semantics are presented. The complexity of the evaluation and the satisfiability problems under the derived semantics is analyzed. For many important cases, the complexity is tractable and hence, the proposed interconnection semantics can be efficiently applied to real-world XML documents.