CN1764916A - 用于频率计数的方法和装置 - Google Patents
用于频率计数的方法和装置 Download PDFInfo
- Publication number
- CN1764916A CN1764916A CNA03826336XA CN03826336A CN1764916A CN 1764916 A CN1764916 A CN 1764916A CN A03826336X A CNA03826336X A CN A03826336XA CN 03826336 A CN03826336 A CN 03826336A CN 1764916 A CN1764916 A CN 1764916A
- Authority
- CN
- China
- Prior art keywords
- event type
- counting
- frequency
- count
- storage
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/955—Retrieval from the web using information identifiers, e.g. uniform resource locators [URL]
- G06F16/9562—Bookmark management
Abstract
Description
//Basic frequency counting pseudocode implementation Public functions init://setup of primary and secondary storages add_one_count(string e)://increase the count of event type e by one count(string e)://return the(approximate)count of event typye e kth_best(integer k)://return the kth highest<event type,count>pair, //k<=m Internal functions upgrade(integer hash,string e): //moves the count indexed by hash(last observed as type e) //from secondary to primary storage and downgrades the //least count from primary storage to secondary storage <!-- SIPO <DP n="10"> --> <dp n="d10"/> move_up(integer i)://keep primary storage sorted by count,after an //increase inthe count of ith event hash(string e): //a hash function from strings to[1,n](to secondary //storage) Data structures primary: //Array of m<string,integer>pairs,representing event types and their counts, //sorted in decreasing order by count.Contents are referred to by notations //primary[i].count(the i:th highest count)and primary[i].event_type(the event//type which has the i:th highest count).Indexing runs from 1to m. sencondary: //Array of n integers(counts),unsorted.Contents are referred to by notation //secondary[i].count(count associated with the i:th entry in the array).Indexing//from 1to n. function init: //setup of primary and secondary storages //a)<event type,count>pairs primary:=array of m<string,integer>pairs; //b)counts secondary:=array of n integers; for(i:=1to m) primary[i].event_type:=″″; primary[i].count:=0; endfor; for(j:=1to n) secondary[j].count:=0; endfor; function add_one count(string e): //increase the count of eventtvpe e by 1 if(there exists i such that primary [i].event_type=e)the <!-- SIPO <DP n="11"> --> <dp n="d11"/> primary[i].count++; move_up(i); else hash:=hash(e); secondary[hash].count++; if(secondary[hash].count>primary[m].count)then upgrade(hash,e); endif; function count(string e): //return the(approximate)count of event type e if(there exists i such that primary[i].event_type=e)then return primary[i].count; else hash:=hash(e); return secondary[hash].count; endif; function kth_best(integer k): //return the kth highest<event type,count>pair,k<=m if(k<=m and primary[k]!=0)then return pair(primary[k].event_type,primary[k].count); else return pair(″″,0); endif; function upgrade(integer hash,string e): //Moyes the count indexed by hash and lst observed //as type e from secondary to primary storage and //downgrades the least count from primary storage to //secondary storage. //1.release space in secondary storage: count:=secondary[hash].count; secondary(hash).count:=0; <!-- SIPO <DP n="12"> --> <dp n="d12"/> //2.copy count from primary to secondary storage: down_hash:=hash(primary[m].event_type); secondary[down_hash]:=primary[m].count; //3.copy upgraded information to primary storage: primary[m].event_type:=e; primary[m].count:=count; move_up(m); function move_up(integer i): //keep primary storage sorted by count,after an increase //the count of ith event while(I>1and primary[i].count>primary[i-1].count) swap primary[i]and primary[i-1]; i--; endwhile; function hash(string e): //a hash function from strings to[1,n](to secondary storage) //A wide variety of suitable hash functions exist as prior art,see e.g. //-M.V.Ramakrishna and J.Zobel:Performance in practice of string //hashing functions. //-Proc.Fifth Int.Conf.on Database Systems for Advanced Applications, //Melbourne,Australia,April 1-4,1997. //-D.E.Knuth:The Art of Computer Programming.Volume 3:Sorting and //Searching,Addison-Wesley,Reading,Massachusetts,1973. //T.H.Cormen,C.E.Leiserson,and R.L.Rivest:Introduction to Algorithms, //MIT press,Cambridge,MA,1990. //A simple and practical method(Ramakrishna&Zobel),using C++ //syntax: int h=strlen(e); //int assumed to be 32bits for(char*key=e;*key!=0;key++) <!-- SIPO <DP n="13"> --> <dp n="d13"/> //^:bitwise xor;<<:left shift;>>:right shift h=h^(<<5+h>>2+*key); return(h%n)+1;
move_down(interger i): //keep primary storage sorted by count,after a decrease in the count ofi move up_secondary(interger i): //keep secondary storage sorted by count,after an increase in the count ofi move_down_secondary(interger i): //keep secondary storage sorted by count,after an decrease in the count ofi readj ust_counts: //upd ate all counts with the correction factor f and reset f Data structures primary: //Array of m<string,real>pairs,comparable to the primary storage in the first //implementation secondary: //Array ofn<long,real>pairs,representing hash codes of event types and their //counts,sorted indecreasing order by count.Contcnts are referred to by //notations secondary[i].count(the i:th highest count in the array)and //secondary[i].hash(the hash code which has the i:th highest count in the //array).Indexing from 1ton. f: //Correction factor for counts for aging:the adjusted″true″value is f*count.In //the same way,when a count is incremented by a,the internal value is updated //by a/f to obtain a value proportional to the internal representation. //Pseudocode implementation for more versatile frequency counting //implementation with frequency weighting support. function init: //setup of primary and secondary storages primary:=array of m<string,real>pairs;//<eventtype,count>pairs secondary:=array of n<long,real>pairs;//<hash(event type),count>pairs for(i:=1to m) <!-- SIPO <DP n="16"> --> <dp n="d16"/> primary[i].event_type:=″″; primary[i].count:=0; endfor; for(j:=1to n) secondary[j].hash:=0; secondary[j].count:=0; endfor; f:=1; //correction factor for counts function add_count(string e,real a): //increase(or decrease)the count of event type e by a if(there exists i such that primary[i].event_type=e)then primary[i].count:=primary[i].count+a/f; if(a>0)then move_up(i); else move_down(i); endif; if(primary[i].count>FLT_MAX/2*p)then readjust_counts; //update counts if accuracy is at stake endif; else hash:=hash(e); if(there existi such that secondary[i].hash=hash)then secondary[i].count:=secondary[i].count+a/f; else secondary[n].hash:=hash; secondary[n].count:=a/f; i:=n; endif; <!-- SIPO <DP n="17"> --> <dp n="d17"/> if(secondary[i].count>primary[m].count)then upgrade(i,e); else if(a>0)then move_up_secondary(i); //sort the secondary storage else move_down_secondary(i); endif; endif; endif; function count(string e): //return the(approximate)count of event type e if(there exists i such that primary[i].event_type=e)then return primary[i].count*f; else hash:=hash(e); if(there exists i such that secondary[i].hash=hash)then return secondary[i].count*f; elsif; return0; endif; endif; function kth_best(integer k)://return the kth highest<event type,count>pair,k<=m if(k<=m and primary[k]!=0)then return pair(primary[k].event_type,primary[k].count*f); else return pair(″″,0); endif; function downweight: //an aging mechanism,multiply all counts by factor p f=f*p;//Do not actually multiply counts,just update the correction factor <!-- SIPO <DP n="18"> --> <dp n="d18"/> if(f<FLT_MIN*2/p)then //update counts if accuracy is at stake readjust_counts; endif; function readjust_counts //update all counts with the correction factor f and reset //f to be called when numerical accuracy is at stake for(i:=1to m) primary[i].count:=primary[i].count*f; endfor; for(j:=1ton) secondary[j].count:=secondary[j].count*f; endfor; f:=1; function upgrade(integer i,string e): //Moves the count indexed by i and last observed as type e from secondary to //primary storage and downgrades the least count from primary storage to //secondary storage. //1.release space in secondary storage: count:=secondary[i].count; remove_from_secondary(i); //removes row i from secondary storage and //shifts rows [1..i-1]one row down(to rows[2..i]) //so the first row in secondary storage is empty. //function not presented here as considered obvious //2.copy count from primaryto secondary storage: down_hash:=hash(primary[m].event_type); secondary[l].hash:=down_hash; secondary[l].count:=primary[m].count; move_down_secondary(l); //3.copy upgraded information to primary storage: prima ry[m].event_type:=e; <!-- SIPO <DP n="19"> --> <dp n="d19"/> primary[m].count:=count; move_up(m); function move_up(integer i): //keep primary storage sorted by count,after an increase in the count of i while(i>1 and primary[i].count>primary[i-1].count) swap primary[i]and primary[i-1]; i--; endwhile; function move_down(integer i): //keep primary storage sorted by count,after an decrease in the count of i while(i<m and primary[i].count<primary[i+1].count) swap primary[i]and primary[i+1]; i++; endwhile //Note:no downgrade operation to switch entries in primary and secondary //storage if this count is smarller than the largest entry in the secondary storage. //Reason:event names for entries in the secondary storage not available. function move_up_secondary(integer i): //keep secondary storage sorted by count,after an increase in the count of i while(i>1 and secondary[i].count>secondary[i-1].count) swap secondary[i]and secondary[i-1]; i--; endwhile; function move_down_secondary(integer i): //keep secondary storage sorted by count,after an decrease in the count of i while(i<m and secondary[i].count<secondary[i+1].count) swap secondary[i]and secondary[i+1]; i++; endwhile; <!-- SIPO <DP n="20"> --> <dp n="d20"/> function hash(string e): //a hash function from string to[1,2^32-1](to secondary storage) //by Ramakrishna&Zobel,using C++syntax: int h=strlen(e); //int assumed to be 32 bits for(char*key=e;*key!=0;key++) //^:bitwise xor;<<:left shift;>>:right shift,%:modulo h=h^(<<5+h>>2+*key); return h+1;
set p.visited_this_session=false for all pages p in Rec set s.visited_this_session=false for all site s in Sites -会话期间,当请求Rec中的网页p时: set p.visited_this_session=true set s.visited_this_session=true for the site s of p //the score is increased by a certain amount if the page(or site)was visited //during a session,regardless of the number of visits -会话之后,更新所有的分数并排序: for all pages p in Rec:call update_score(p) for all sites s in Sites:call update_score(s) call update_score(total) function update_score(u){ u.score=u.score*session_decay_constant if u.visited_this_session=true then u.score=u.score*frequency_decay_constant+1 //the decay_constants between 0and 1 determine the adaptation speed sort recommendations p inRec in descending order by their scores p.score 当访问新的页面时:在会话期间,当请求的页面p没有包括在 Rec或New_rec中时,创建建议页面p并将其插入到New_rec中并存 储下面的信息: p.URL:URL of the page p.name:page title(according to a selected naming scene) p.score=0 //an individual page is not recommented after only one //visit to it if address(p.URL)is not in Sites and is different from the sites in New_rec set p.score=1 //a new site is recommented already after one visit,but only the first page in it 如果p已经在New_rec中,不做任何动作。会话之后以及为 New_rec中的每一个入口p更新建议分数之后: <!-- SIPO <DP n="23"> --> <dp n="d23"/> an entry is added for site address(p.URL)to Sites(if not there yet),set s.score=1 pis added to Rec and removed from New_rec
Claims (52)
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/FI2003/000177 WO2004079597A1 (en) | 2003-03-07 | 2003-03-07 | A method and a device for frequency counting |
Publications (2)
Publication Number | Publication Date |
---|---|
CN1764916A true CN1764916A (zh) | 2006-04-26 |
CN1764916B CN1764916B (zh) | 2010-08-18 |
Family
ID=32947023
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN03826336XA Expired - Fee Related CN1764916B (zh) | 2003-03-07 | 2003-03-07 | 用于频率计数的方法和装置 |
Country Status (6)
Country | Link |
---|---|
US (1) | US9280607B2 (zh) |
EP (1) | EP1627335A1 (zh) |
CN (1) | CN1764916B (zh) |
AU (1) | AU2003209790A1 (zh) |
HK (1) | HK1089253A1 (zh) |
WO (1) | WO2004079597A1 (zh) |
Cited By (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101677338A (zh) * | 2008-09-18 | 2010-03-24 | 深圳富泰宏精密工业有限公司 | 快捷列表排序系统及方法 |
CN101923577A (zh) * | 2010-09-02 | 2010-12-22 | 北京开心人信息技术有限公司 | 一种可扩展的计数方法与系统 |
CN102368245A (zh) * | 2010-09-14 | 2012-03-07 | 微软公司 | 相关网站的确定和显示 |
CN102651008A (zh) * | 2011-02-28 | 2012-08-29 | 国际商业机器公司 | 在关系数据库中组织数据记录的方法和设备 |
CN102841736A (zh) * | 2011-05-03 | 2012-12-26 | 宏达国际电子股份有限公司 | 手持式电子装置及其网页书签存取方法 |
WO2013166998A1 (zh) * | 2012-11-16 | 2013-11-14 | 中兴通讯股份有限公司 | 浏览器书签的管理方法及装置 |
CN103632194A (zh) * | 2013-11-30 | 2014-03-12 | 林淑琴 | 一种网站访客流量计数器 |
CN109145118A (zh) * | 2018-09-06 | 2019-01-04 | 北京京东尚科信息技术有限公司 | 信息管理方法和装置 |
CN109213413A (zh) * | 2017-07-07 | 2019-01-15 | 阿里巴巴集团控股有限公司 | 一种推荐方法、装置、设备和存储介质 |
Families Citing this family (52)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20040217991A1 (en) * | 2003-04-30 | 2004-11-04 | International Business Machines Corporation | Method and apparatus for dynamic sorting and displaying of listing data composition and automating the activation event |
US20050015728A1 (en) * | 2003-07-17 | 2005-01-20 | International Business Machines Corporation | Method, system, and program product for customizing a user interface |
US7657423B1 (en) | 2003-10-31 | 2010-02-02 | Google Inc. | Automatic completion of fragments of text |
US7418455B2 (en) * | 2003-11-26 | 2008-08-26 | International Business Machines Corporation | System and method for indexing weighted-sequences in large databases |
US8954420B1 (en) | 2003-12-31 | 2015-02-10 | Google Inc. | Methods and systems for improving a search ranking using article information |
US20050149498A1 (en) * | 2003-12-31 | 2005-07-07 | Stephen Lawrence | Methods and systems for improving a search ranking using article information |
US8386728B1 (en) | 2004-03-31 | 2013-02-26 | Google Inc. | Methods and systems for prioritizing a crawl |
US7333976B1 (en) * | 2004-03-31 | 2008-02-19 | Google Inc. | Methods and systems for processing contact information |
US8161053B1 (en) | 2004-03-31 | 2012-04-17 | Google Inc. | Methods and systems for eliminating duplicate events |
US8099407B2 (en) | 2004-03-31 | 2012-01-17 | Google Inc. | Methods and systems for processing media files |
US8631076B1 (en) | 2004-03-31 | 2014-01-14 | Google Inc. | Methods and systems for associating instant messenger events |
US8346777B1 (en) | 2004-03-31 | 2013-01-01 | Google Inc. | Systems and methods for selectively storing event data |
JP2007109114A (ja) * | 2005-10-17 | 2007-04-26 | Matsushita Electric Ind Co Ltd | 機能操作画面表示制御方法 |
US7792761B2 (en) * | 2005-11-01 | 2010-09-07 | International Business Machines Corporation | System for evaluating relevance between persons |
US10324899B2 (en) | 2005-11-07 | 2019-06-18 | Nokia Technologies Oy | Methods for characterizing content item groups |
JP2007316934A (ja) * | 2006-05-25 | 2007-12-06 | Fujitsu Ltd | 情報処理装置、情報処理方法及びプログラム |
US8015571B2 (en) * | 2007-03-16 | 2011-09-06 | Google Inc. | Registering an event |
US7644075B2 (en) * | 2007-06-01 | 2010-01-05 | Microsoft Corporation | Keyword usage score based on frequency impulse and frequency weight |
US9251137B2 (en) * | 2007-06-21 | 2016-02-02 | International Business Machines Corporation | Method of text type-ahead |
US7680978B1 (en) * | 2007-09-05 | 2010-03-16 | Juniper Networks, Inc. | Reducing content addressable memory (CAM) power consumption counters |
US8316035B2 (en) | 2008-01-16 | 2012-11-20 | International Business Machines Corporation | Systems and arrangements of text type-ahead |
US8359532B2 (en) * | 2008-04-28 | 2013-01-22 | International Business Machines Corporation | Text type-ahead |
US20090300495A1 (en) * | 2008-06-02 | 2009-12-03 | Novell, Inc. | System and method for an adaptive wizard utility for graphical user interfaces |
US11048765B1 (en) | 2008-06-25 | 2021-06-29 | Richard Paiz | Search engine optimizer |
CN101770339B (zh) * | 2009-01-05 | 2012-12-19 | 深圳富泰宏精密工业有限公司 | 使用者行为追踪及记录系统与方法 |
US9292612B2 (en) * | 2009-04-22 | 2016-03-22 | Verisign, Inc. | Internet profile service |
US8521908B2 (en) * | 2009-04-07 | 2013-08-27 | Verisign, Inc. | Existent domain name DNS traffic capture and analysis |
US8290906B1 (en) * | 2009-09-28 | 2012-10-16 | Decho Corporation | Intelligent resource synchronization |
US7716205B1 (en) | 2009-10-29 | 2010-05-11 | Wowd, Inc. | System for user driven ranking of web pages |
US20110154193A1 (en) * | 2009-12-21 | 2011-06-23 | Nokia Corporation | Method and Apparatus for Text Input |
JP5803902B2 (ja) * | 2010-03-12 | 2015-11-04 | 日本電気株式会社 | 関連情報出力装置、関連情報出力方法および関連情報出力プログラム |
US20110251964A1 (en) * | 2010-04-13 | 2011-10-13 | Jayavel Shanmugasundaram | Pricing Guaranteed Delivery Contracts in Online Display |
US11379473B1 (en) * | 2010-04-21 | 2022-07-05 | Richard Paiz | Site rank codex search patterns |
US11423018B1 (en) * | 2010-04-21 | 2022-08-23 | Richard Paiz | Multivariate analysis replica intelligent ambience evolving system |
JP2012018487A (ja) * | 2010-07-06 | 2012-01-26 | Fujitsu Ltd | ノード決定プログラム、ノード決定装置およびノード決定方法 |
US20120310743A1 (en) * | 2011-01-04 | 2012-12-06 | Rajul Johri | Using mobile devices to make secure and reliable payments for store or online purchases |
US8468164B1 (en) * | 2011-03-09 | 2013-06-18 | Amazon Technologies, Inc. | Personalized recommendations based on related users |
US8725779B1 (en) * | 2011-05-06 | 2014-05-13 | Aggregate Knowledge, Inc. | System and method for counting and storing events as scalar quantities in skewed counting environments |
US9141613B2 (en) * | 2012-10-30 | 2015-09-22 | Appsense Limited | Systems and methods for determining an address for a private function |
JP6113463B2 (ja) * | 2012-11-15 | 2017-04-12 | 任天堂株式会社 | 情報処理プログラム、リンク管理装置、表示システム及び表示方法 |
US10649607B2 (en) * | 2012-12-28 | 2020-05-12 | Facebook, Inc. | Re-ranking story content |
US11741090B1 (en) | 2013-02-26 | 2023-08-29 | Richard Paiz | Site rank codex search patterns |
US11809506B1 (en) * | 2013-02-26 | 2023-11-07 | Richard Paiz | Multivariant analyzing replicating intelligent ambience evolving system |
US10846292B2 (en) * | 2013-03-14 | 2020-11-24 | Vmware, Inc. | Event based object ranking in a dynamic system |
KR101893957B1 (ko) | 2013-08-19 | 2018-08-31 | 삼성에스디아이 주식회사 | 배터리 팩, 배터리 팩을 포함하는 장치, 및 배터리 팩의 관리 방법 |
WO2015041648A1 (en) * | 2013-09-19 | 2015-03-26 | Hewlett-Packard Development Company, L.P. | Application menu modification recommendations |
US9805099B2 (en) * | 2014-10-30 | 2017-10-31 | The Johns Hopkins University | Apparatus and method for efficient identification of code similarity |
US9906542B2 (en) * | 2015-03-30 | 2018-02-27 | Microsoft Technology Licensing, Llc | Testing frequency control using a volatility score |
US10769229B2 (en) * | 2016-04-14 | 2020-09-08 | Microsoft Technology Licensing, Llc | Separation of work and personal content |
US10997120B2 (en) * | 2017-03-16 | 2021-05-04 | Cisco Technology, Inc. | Systems and methods for device visiting frequency estimation |
US10467433B2 (en) | 2017-03-17 | 2019-11-05 | Mediasift Limited | Event processing system |
US10645171B1 (en) * | 2019-06-10 | 2020-05-05 | Csg Systems, Inc. | System and method for network and customer device provisioning |
Family Cites Families (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CA2043493C (en) * | 1990-10-05 | 1997-04-01 | Ricky C. Hetherington | Hierarchical integrated circuit cache memory |
JPH09265429A (ja) * | 1996-01-23 | 1997-10-07 | Fujitsu Ltd | データ配信装置、記憶装置とその制御方法およびデータ転送システム |
US5935207A (en) * | 1996-06-03 | 1999-08-10 | Webtv Networks, Inc. | Method and apparatus for providing remote site administrators with user hits on mirrored web sites |
US6125392A (en) * | 1996-10-11 | 2000-09-26 | Intel Corporation | Method and apparatus for high speed event log data compression within a non-volatile storage area |
ATE504880T1 (de) | 1999-11-03 | 2011-04-15 | Sublinks Aps | Methode, system und computerlesbares medium zum verwalten von verbindungen zwischen ressourcen |
US6564213B1 (en) * | 2000-04-18 | 2003-05-13 | Amazon.Com, Inc. | Search query autocompletion |
GB2373679B (en) * | 2001-03-22 | 2004-04-07 | Ericsson Telefon Ab L M | Mobile communications device |
US6754854B2 (en) * | 2001-06-04 | 2004-06-22 | Motorola, Inc. | System and method for event monitoring and error detection |
-
2003
- 2003-03-07 EP EP03816140A patent/EP1627335A1/en not_active Withdrawn
- 2003-03-07 US US10/548,741 patent/US9280607B2/en not_active Expired - Fee Related
- 2003-03-07 WO PCT/FI2003/000177 patent/WO2004079597A1/en not_active Application Discontinuation
- 2003-03-07 AU AU2003209790A patent/AU2003209790A1/en not_active Abandoned
- 2003-03-07 CN CN03826336XA patent/CN1764916B/zh not_active Expired - Fee Related
-
2006
- 2006-08-25 HK HK06109450.8A patent/HK1089253A1/xx not_active IP Right Cessation
Cited By (14)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101677338A (zh) * | 2008-09-18 | 2010-03-24 | 深圳富泰宏精密工业有限公司 | 快捷列表排序系统及方法 |
CN101677338B (zh) * | 2008-09-18 | 2013-06-05 | 深圳富泰宏精密工业有限公司 | 快捷列表排序系统及方法 |
CN101923577B (zh) * | 2010-09-02 | 2013-03-20 | 北京开心人信息技术有限公司 | 一种可扩展的计数方法与系统 |
CN101923577A (zh) * | 2010-09-02 | 2010-12-22 | 北京开心人信息技术有限公司 | 一种可扩展的计数方法与系统 |
US8893042B2 (en) | 2010-09-14 | 2014-11-18 | Microsoft Corporation | Determination and display of relevant websites |
CN102368245A (zh) * | 2010-09-14 | 2012-03-07 | 微软公司 | 相关网站的确定和显示 |
CN102651008A (zh) * | 2011-02-28 | 2012-08-29 | 国际商业机器公司 | 在关系数据库中组织数据记录的方法和设备 |
US8972403B2 (en) | 2011-02-28 | 2015-03-03 | International Business Machines Corporation | Method of and apparatus for organizing data records in a relational database |
CN102651008B (zh) * | 2011-02-28 | 2015-06-17 | 国际商业机器公司 | 在关系数据库中组织数据记录的方法和设备 |
CN102841736A (zh) * | 2011-05-03 | 2012-12-26 | 宏达国际电子股份有限公司 | 手持式电子装置及其网页书签存取方法 |
WO2013166998A1 (zh) * | 2012-11-16 | 2013-11-14 | 中兴通讯股份有限公司 | 浏览器书签的管理方法及装置 |
CN103632194A (zh) * | 2013-11-30 | 2014-03-12 | 林淑琴 | 一种网站访客流量计数器 |
CN109213413A (zh) * | 2017-07-07 | 2019-01-15 | 阿里巴巴集团控股有限公司 | 一种推荐方法、装置、设备和存储介质 |
CN109145118A (zh) * | 2018-09-06 | 2019-01-04 | 北京京东尚科信息技术有限公司 | 信息管理方法和装置 |
Also Published As
Publication number | Publication date |
---|---|
US20070033275A1 (en) | 2007-02-08 |
WO2004079597A1 (en) | 2004-09-16 |
US9280607B2 (en) | 2016-03-08 |
HK1089253A1 (en) | 2006-11-24 |
CN1764916B (zh) | 2010-08-18 |
EP1627335A1 (en) | 2006-02-22 |
AU2003209790A1 (en) | 2004-09-28 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN1764916B (zh) | 用于频率计数的方法和装置 | |
US9971842B2 (en) | Computerized systems and methods for generating a dynamic web page based on retrieved content | |
US8521717B2 (en) | Propagating information among web pages | |
US9613088B2 (en) | Systems and methods for query optimization | |
CN102622450B (zh) | 用户的浏览器历史的相关性排序 | |
US8229911B2 (en) | Network search engine utilizing client browser activity information | |
US8656264B2 (en) | Dynamic aggregation and display of contextually relevant content | |
KR101214688B1 (ko) | 콘텐츠의 집계, 배포, 공유, 및 업데이트의 사회적 측면들 | |
US8176029B2 (en) | Composite display method and system for search engine of same resource information based on degree of attention | |
JP5661104B2 (ja) | 検索エンジンインデクシング及びインデックスを使用する検索のための方法とシステム | |
JP5147947B2 (ja) | クエリ別検索コレクション生成方法およびシステム | |
CN107103032B (zh) | 一种分布式环境下避免全局排序的海量数据分页查询方法 | |
US20090006388A1 (en) | Search result ranking | |
CN1403964A (zh) | 书签管理系统和书签管理方法 | |
CN101079063A (zh) | 一种基于场景信息推送广告的方法、系统及设备 | |
CN1601532A (zh) | 根据结构相关信息排序文档的改进的系统和方法 | |
US9171045B2 (en) | Recommending queries according to mapping of query communities | |
CN102193999A (zh) | 一种对搜索结果进行排序的方法及设备 | |
CN104423621A (zh) | 拼音字符串处理方法和装置 | |
CN102955810B (zh) | 一种网页分类方法和设备 | |
CN102214207A (zh) | 一种用于对信息实体中的属性集合进行排序的方法与设备 | |
US20080189334A1 (en) | Method of Global Popularity based Prioritization in Information Engine with Consumer ==Author and Dynamic Web models for global, multimedia, and mobile Internet | |
US20200394194A1 (en) | Multi-vertical entity-based search system | |
CN101114293A (zh) | 一种根据读者关注度而变化信息显示的方法 | |
CN1524238A (zh) | 用于定义和呈现复合网页的系统及方法 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
REG | Reference to a national code |
Ref country code: HK Ref legal event code: DE Ref document number: 1089253 Country of ref document: HK |
|
C14 | Grant of patent or utility model | ||
GR01 | Patent grant | ||
REG | Reference to a national code |
Ref country code: HK Ref legal event code: GR Ref document number: 1089253 Country of ref document: HK |
|
C41 | Transfer of patent application or patent right or utility model | ||
TR01 | Transfer of patent right |
Effective date of registration: 20160125 Address after: Espoo, Finland Patentee after: Technology Co., Ltd. of Nokia Address before: Espoo, Finland Patentee before: Nokia Oyj |
|
CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20100818 Termination date: 20170307 |
|
CF01 | Termination of patent right due to non-payment of annual fee |