ACM Computing Surveys (CSUR) - Annals of discrete mathematics, 24
The performance of three database storage structures for managing large objects
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
XRANK: ranked keyword search over XML documents
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Mixed mode XML query processing
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
n-gram/2L: a space and time efficient two-level n-gram inverted index structure
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Structural optimization of a full-text n-gram index using relational normalization
The VLDB Journal — The International Journal on Very Large Data Bases
DB-IR integration and its application to a massively-parallel search engine
Proceedings of the 18th ACM conference on Information and knowledge management
A new DBMS architecture for DB-IR integration
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
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
ACM SIGMOD Record
Structural consistency: enabling XML keyword search to eliminate spurious results consistently
The VLDB Journal — The International Journal on Very Large Data Bases
Information Sciences: an International Journal
Type-Level access pattern view: a technique for enhancing prefetching performance
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
A practitioner's approach to normalizing XQuery expressions
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Hi-index | 0.00 |
We propose the notion of tight-coupling [8] to add new data types into the DBMS engine. In this paper, we introduce the Odysseus ORDBMS and present its tightly-coupled IR features (U.S. patented). We demonstrate a web search engine capable of managing 20 million web pages in a non-parallel configuration using Odysseus.