On saying “Enough already!” in SQL
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Database techniques for the World-Wide Web: a survey
ACM SIGMOD Record
Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
Squeal: a structured query language for the Web
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
ACM Transactions on Internet Technology (TOIT)
Modern Information Retrieval
Queries and Computation on the Web
ICDT '97 Proceedings of the 6th International Conference on Database Theory
The Design and Implementation of a Sequence Database System
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
SRQL: Sorted Relational Query Language
SSDBM '98 Proceedings of the 10th International Conference on Scientific and Statistical Database Management
Structure and value synopses for XML data graphs
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
RankSQL: query algebra and optimization for relational top-k queries
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Stanford WebBase components and applications
ACM Transactions on Internet Technology (TOIT)
CLBCRA-Approach for Combination of Content-Based and Link-Based Ranking in Web Search
ADMA '07 Proceedings of the 3rd international conference on Advanced Data Mining and Applications
A model for fast web mining prototyping
Proceedings of the Second ACM International Conference on Web Search and Data Mining
Flexible and efficient querying and ranking on hyperlinked data sources
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Scalable manipulation of archival web graphs
Proceedings of the 9th workshop on Large-scale and distributed informational retrieval
NewPR-Combining TFIDF with pagerank
ICANN'06 Proceedings of the 16th international conference on Artificial Neural Networks - Volume Part II
| Hi-index | 0.00 |
Web repositories, such as the Stanford WebBase repository, manage large heterogeneous collections of Web pages and associated indexes. For effective analysis and mining, these repositories must provide a declarative query interface that supports complex expressive Web queries. Such queries have two key characteristics: (i) They view a Web repository simultaneously as a collection of text documents, as a navigable directed graph, and as a set of relational tables storing properties of Web pages (length, URL, title, etc.). (ii) The queries employ application-specific ranking and ordering relationships over pages and links to filter out and retrieve only the "best" query results. In this paper, we model a Web repository in terms of "Web relations" and describe an algebra for expressing complex Web queries. Our algebra extends traditional relational operators as well as graph navigation operators to uniformly handle plain, ranked, and ordered Web relations. In addition, we present an overview of the cost-based optimizer and execution engine that we have developed, to efficiently execute Web queries over large repositories.