On understanding types, data abstraction, and polymorphism
ACM Computing Surveys (CSUR) - The MIT Press scientific computation series
CLASSIC: a structural data model for objects
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Hy+: a Hygraph-based query and visualization system
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
A query language and optimization techniques for unstructured data
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
A query language for a Web-site management system
ACM SIGMOD Record
LDAP: programming directory-enabled applications with lightweight directory access protocol
LDAP: programming directory-enabled applications with lightweight directory access protocol
Applications of a Web query language
Selected papers from the sixth international conference on World Wide Web
Focusing search in hierarchical structures with directory sets
Proceedings of the seventh international conference on Information and knowledge management
Flexible list management in a directory
Proceedings of the seventh international conference on Information and knowledge management
What can knowledge representation do for semi-structured data?
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
GraphLog: a visual formalism for real life recursion
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
Principles of Database Systems
Principles of Database Systems
Complex Aggregation at Multiple Granularities
EDBT '98 Proceedings of the 6th International Conference on Extending Database Technology: Advances in Database Technology
Adding Structure to Unstructured Data
ICDT '97 Proceedings of the 6th International Conference on Database Theory
DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
TOPS: an architecture for telephony over packet networks
IEEE Journal on Selected Areas in Communications
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On effective multi-dimensional indexing for strings
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Minimization of tree pattern queries
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
RQL: a declarative query language for RDF
Proceedings of the 11th international conference on World Wide Web
Algorithmics and applications of tree and graph searching
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient algorithms for minimizing tree pattern queries
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Locating Objects in Mobile Computing
IEEE Transactions on Knowledge and Data Engineering
Using histograms to estimate answer sizes for XML queries
Information Systems - Special issue: Best papers from EDBT 2002
On Bounding-Schemas for LDAP Directories
EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
Estimating Answer Sizes for XML Queries
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
What can Hierarchies do for Data Warehouses?
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Proceedings of the 27th International Conference on Very Large Data Bases
LDAP, Databases and Distributed Objects: Towards a Better Integration
DBTel '01 Proceedings of the VLDB 2001 International Workshop on Databases in Telecommunications II
Tree pattern query minimization
The VLDB Journal — The International Journal on Very Large Data Bases
XRANK: ranked keyword search over XML documents
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Querying the Semantic Web with RQL
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: The Semantic Web: an evolution for a revolution
Distributed Evaluation of Network Directory Queries
IEEE Transactions on Knowledge and Data Engineering
Edge caching for directory based web applications: algorithms and performance
Web content caching and distribution
Integrating document and data retrieval based on XML
The VLDB Journal — The International Journal on Very Large Data Bases
Using partial evaluation in distributed query evaluation
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
GDSE: a new data source oriented computing element for grid
PDCN'06 Proceedings of the 24th IASTED international conference on Parallel and distributed computing and networks
A unified approach to structured and XML data modeling and manipulation
Data & Knowledge Engineering
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Journal of Computer and System Sciences
Caching frequent XML query patterns
APWeb'06 Proceedings of the 2006 international conference on Advanced Web and Network Technologies, and Applications
Partial Evaluation for Distributed XPath Query Processing and Beyond
ACM Transactions on Database Systems (TODS)
Hi-index | 0.00 |
Heirarchically structured directories have recently proliferated with the growth of the Internet, and are being used to store not only address books and contact information for people, but also personal profiles, network resource information, and network and service policies. These systems provide a means for managing scale and heterogeneity, while allowing for conceptual unity and autonomy across multiple directory servers in the network, in a way for superior to what conventional relational or object-oriented databases offer. Yet, in deployed systems today, much of the data is modeled in an ad hoc manner, and many of the more sophisticated “queries” involve navigational access.In this paper, we develop the core of a formal data model for network directories, and propose a sequence of efficiently computable query languages with increasing expressive power. The directory data model can naturally represent rich forms of heterogeneity exhibited in the real world. Answers to queries expressible in our query languages can exhibit the same kinds of heterogeneity. We present external memory algorithms for the evaluation of queries posed in our directory query languages, and prove the efficiency of each algorithm in terms of its I/O complexity. Our data model and query languages share the flexibility and utility of the recent proposals for semi-structured data models, while at the same time effectively addressing the specific needs of network directory applications, which we demonstrate by means of a representative real-life example.