Web search engine based on DNS
Wang Liang, Guo YiPing, Fang Ming
Abstract
Now no web search engine can cover more than 60 percent of all the pages on Internet. The update interval of most pages database is almost one month. This condition hasn't changed for many years. Converge and recency problems have become the bottleneck problem of current web search engine. To solve these problems, a new system, search engine based on DNS is proposed in this paper. This system adopts the hierarchical distributed architecture like DNS, which is different from any current commercial search engine. In theory, this system can cover all the web pages on Internet. Its update interval could even be one day. The original idea, detailed content and implementation of this system all are introduced in this paper.
Create a lesson
Related papers
Coarse-Grained Predictive Resource Allocation Framework enabling In-Premise XR Collaborations
Sourav Mondal, Elaine Wong
The Evolution of In-Premise Networks In the Era of Immersive Services: From Copper to Fiber-to-The Room [Invited Tutorial]
Elaine Wong, Sourav Mondal
Cost-Aware Conflict Triage for xApp Control Conflicts in Open RAN
Abdul Wadud, Fatemeh Golpayegani, Nima Afraz
NAS Timers for Non-Terrestrial Networks: Current Standards and Directions
Cheng Liu, Peng Hu
Tutorial on Closed-Loop and Application-Aware Digital Twins for Future Wireless Networks
Yuchen Liu, Sara Garcia Sanchez, Mingzhe Chen et al.
Clock-Free Stochastic Scheduling for Real-Time Synchronized Content Delivery
Xuan Wang, Xiaoyi Wu, Ying Sun et al.