Efficient Filtering Algorithms for Location-Aware Publish/Subscribe

Location-based services have been widely adopted in many systems. Existing works employ a pull model or user-initiated model, where a user issues a query to a server which replies with location-aware answers. To provide users with instant replies, a push model or server-initiated model is becoming a...
Ausführliche Beschreibung

Gespeichert in:

Autor*in:	Minghe Yu [verfasserIn] Guoliang Li Ting Wang Jianhua Feng Zhiguo Gong

Format:	Artikel
Sprache:	Englisch

Erschienen:	2015

Schlagwörter:	pruning techniques location-aware answers Time complexity next-generation location-based services middleware push model question answering (information retrieval) mobile computing ranking queries Semantics Computational modeling Indexes Subscriptions R-tree based index location-aware publish/subscribe system conjunctive queries spatio-textual messages server-initiated model R-tree nodes Keyword search information filtering efficient filtering algorithms subscribers register spatio-textual subscriptions

Systematik:	SA 5571

Übergeordnetes Werk:	Enthalten in: IEEE transactions on knowledge and data engineering - New York, NY : IEEE, 1989, 27(2015), 4, Seite 950-963
Übergeordnetes Werk:	volume:27 ; year:2015 ; number:4 ; pages:950-963

Links:	Volltext Link aufrufen Link aufrufen

DOI / URN:	10.1109/TKDE.2014.2349906

Katalog-ID:	OLC1958213578

Internformat


LEADER	01000caa a2200265 4500
001	OLC1958213578
003	DE-627
005	20230714144305.0
007	tu
008	160206s2015 xx \|\|\|\|\| 00\| \|\|eng c
024	7		\|a 10.1109/TKDE.2014.2349906 \|2 doi
028	5	2	\|a PQ20160617
035			\|a (DE-627)OLC1958213578
035			\|a (DE-599)GBVOLC1958213578
035			\|a (PRQ)c1886-890ee9cdfc95c6a7c7072047e4a6d60340dc0bb9e12ce501e82da1cb3970ba970
035			\|a (KEY)0175400920150000027000400950efficientfilteringalgorithmsforlocationawarepublis
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
041			\|a eng
082	0	4	\|a 620 \|a 530 \|a 000 \|q DNB
084			\|a SA 5571 \|q AVZ \|2 rvk
084			\|a 54.00 \|2 bkl
100	0		\|a Minghe Yu \|e verfasserin \|4 aut
245	1	0	\|a Efficient Filtering Algorithms for Location-Aware Publish/Subscribe
264		1	\|c 2015
336			\|a Text \|b txt \|2 rdacontent
337			\|a ohne Hilfsmittel zu benutzen \|b n \|2 rdamedia
338			\|a Band \|b nc \|2 rdacarrier
520			\|a Location-based services have been widely adopted in many systems. Existing works employ a pull model or user-initiated model, where a user issues a query to a server which replies with location-aware answers. To provide users with instant replies, a push model or server-initiated model is becoming an inevitable computing model in the next-generation location-based services. In the push model, subscribers register spatio-textual subscriptions to capture their interests, and publishers post spatio-textual messages. This calls for a high-performance location-aware publish/subscribe system to deliver publishers' messages to relevant subscribers. In this paper, we address the research challenges that arise in designing a location-aware publish/subscribe system. We propose an R-tree based index by integrating textual descriptions into R-tree nodes. We devise efficient filtering algorithms and effective pruning techniques to achieve high performance. Our method can support both conjunctive queries and ranking queries. We discuss how to support dynamic updates efficiently. Experimental results show our method achieves high performance which can filter 500 messages in a second for 10 million subscriptions on a commodity computer.
650		4	\|a pruning techniques
650		4	\|a location-aware answers
650		4	\|a Time complexity
650		4	\|a next-generation location-based services
650		4	\|a middleware
650		4	\|a push model
650		4	\|a question answering (information retrieval)
650		4	\|a mobile computing
650		4	\|a ranking queries
650		4	\|a Semantics
650		4	\|a Computational modeling
650		4	\|a Indexes
650		4	\|a Subscriptions
650		4	\|a R-tree based index
650		4	\|a location-aware publish/subscribe system
650		4	\|a conjunctive queries
650		4	\|a spatio-textual messages
650		4	\|a server-initiated model
650		4	\|a R-tree nodes
650		4	\|a Keyword search
650		4	\|a information filtering
650		4	\|a efficient filtering algorithms
650		4	\|a subscribers register spatio-textual subscriptions
700	0		\|a Guoliang Li \|4 oth
700	0		\|a Ting Wang \|4 oth
700	0		\|a Jianhua Feng \|4 oth
700	0		\|a Zhiguo Gong \|4 oth
773	0	8	\|i Enthalten in \|t IEEE transactions on knowledge and data engineering \|d New York, NY : IEEE, 1989 \|g 27(2015), 4, Seite 950-963 \|w (DE-627)130765732 \|w (DE-600)1001468-8 \|w (DE-576)023036060 \|x 1041-4347 \|7 nnns
773	1	8	\|g volume:27 \|g year:2015 \|g number:4 \|g pages:950-963
856	4	1	\|u http://dx.doi.org/10.1109/TKDE.2014.2349906 \|3 Volltext
856	4	2	\|u http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6880816
856	4	2	\|u http://search.proquest.com/docview/1663304726
912			\|a GBV_USEFLAG_A
912			\|a SYSFLAG_A
912			\|a GBV_OLC
912			\|a SSG-OLC-TEC
912			\|a SSG-OLC-PHY
912			\|a SSG-OLC-MAT
912			\|a SSG-OPC-BBI
936	r	v	\|a SA 5571
936	b	k	\|a 54.00 \|q AVZ
951			\|a AR
952			\|d 27 \|j 2015 \|e 4 \|h 950-963

Indexfelder

author_variant	m y my
matchkey_str	article:10414347:2015----::fiinfleigloihsolctoaae
hierarchy_sort_str	2015
bklnumber	54.00
publishDate	2015
allfields	10.1109/TKDE.2014.2349906 doi PQ20160617 (DE-627)OLC1958213578 (DE-599)GBVOLC1958213578 (PRQ)c1886-890ee9cdfc95c6a7c7072047e4a6d60340dc0bb9e12ce501e82da1cb3970ba970 (KEY)0175400920150000027000400950efficientfilteringalgorithmsforlocationawarepublis DE-627 ger DE-627 rakwb eng 620 530 000 DNB SA 5571 AVZ rvk 54.00 bkl Minghe Yu verfasserin aut Efficient Filtering Algorithms for Location-Aware Publish/Subscribe 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Location-based services have been widely adopted in many systems. Existing works employ a pull model or user-initiated model, where a user issues a query to a server which replies with location-aware answers. To provide users with instant replies, a push model or server-initiated model is becoming an inevitable computing model in the next-generation location-based services. In the push model, subscribers register spatio-textual subscriptions to capture their interests, and publishers post spatio-textual messages. This calls for a high-performance location-aware publish/subscribe system to deliver publishers' messages to relevant subscribers. In this paper, we address the research challenges that arise in designing a location-aware publish/subscribe system. We propose an R-tree based index by integrating textual descriptions into R-tree nodes. We devise efficient filtering algorithms and effective pruning techniques to achieve high performance. Our method can support both conjunctive queries and ranking queries. We discuss how to support dynamic updates efficiently. Experimental results show our method achieves high performance which can filter 500 messages in a second for 10 million subscriptions on a commodity computer. pruning techniques location-aware answers Time complexity next-generation location-based services middleware push model question answering (information retrieval) mobile computing ranking queries Semantics Computational modeling Indexes Subscriptions R-tree based index location-aware publish/subscribe system conjunctive queries spatio-textual messages server-initiated model R-tree nodes Keyword search information filtering efficient filtering algorithms subscribers register spatio-textual subscriptions Guoliang Li oth Ting Wang oth Jianhua Feng oth Zhiguo Gong oth Enthalten in IEEE transactions on knowledge and data engineering New York, NY : IEEE, 1989 27(2015), 4, Seite 950-963 (DE-627)130765732 (DE-600)1001468-8 (DE-576)023036060 1041-4347 nnns volume:27 year:2015 number:4 pages:950-963 http://dx.doi.org/10.1109/TKDE.2014.2349906 Volltext http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6880816 http://search.proquest.com/docview/1663304726 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-PHY SSG-OLC-MAT SSG-OPC-BBI SA 5571 54.00 AVZ AR 27 2015 4 950-963
spelling	10.1109/TKDE.2014.2349906 doi PQ20160617 (DE-627)OLC1958213578 (DE-599)GBVOLC1958213578 (PRQ)c1886-890ee9cdfc95c6a7c7072047e4a6d60340dc0bb9e12ce501e82da1cb3970ba970 (KEY)0175400920150000027000400950efficientfilteringalgorithmsforlocationawarepublis DE-627 ger DE-627 rakwb eng 620 530 000 DNB SA 5571 AVZ rvk 54.00 bkl Minghe Yu verfasserin aut Efficient Filtering Algorithms for Location-Aware Publish/Subscribe 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Location-based services have been widely adopted in many systems. Existing works employ a pull model or user-initiated model, where a user issues a query to a server which replies with location-aware answers. To provide users with instant replies, a push model or server-initiated model is becoming an inevitable computing model in the next-generation location-based services. In the push model, subscribers register spatio-textual subscriptions to capture their interests, and publishers post spatio-textual messages. This calls for a high-performance location-aware publish/subscribe system to deliver publishers' messages to relevant subscribers. In this paper, we address the research challenges that arise in designing a location-aware publish/subscribe system. We propose an R-tree based index by integrating textual descriptions into R-tree nodes. We devise efficient filtering algorithms and effective pruning techniques to achieve high performance. Our method can support both conjunctive queries and ranking queries. We discuss how to support dynamic updates efficiently. Experimental results show our method achieves high performance which can filter 500 messages in a second for 10 million subscriptions on a commodity computer. pruning techniques location-aware answers Time complexity next-generation location-based services middleware push model question answering (information retrieval) mobile computing ranking queries Semantics Computational modeling Indexes Subscriptions R-tree based index location-aware publish/subscribe system conjunctive queries spatio-textual messages server-initiated model R-tree nodes Keyword search information filtering efficient filtering algorithms subscribers register spatio-textual subscriptions Guoliang Li oth Ting Wang oth Jianhua Feng oth Zhiguo Gong oth Enthalten in IEEE transactions on knowledge and data engineering New York, NY : IEEE, 1989 27(2015), 4, Seite 950-963 (DE-627)130765732 (DE-600)1001468-8 (DE-576)023036060 1041-4347 nnns volume:27 year:2015 number:4 pages:950-963 http://dx.doi.org/10.1109/TKDE.2014.2349906 Volltext http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6880816 http://search.proquest.com/docview/1663304726 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-PHY SSG-OLC-MAT SSG-OPC-BBI SA 5571 54.00 AVZ AR 27 2015 4 950-963
allfields_unstemmed	10.1109/TKDE.2014.2349906 doi PQ20160617 (DE-627)OLC1958213578 (DE-599)GBVOLC1958213578 (PRQ)c1886-890ee9cdfc95c6a7c7072047e4a6d60340dc0bb9e12ce501e82da1cb3970ba970 (KEY)0175400920150000027000400950efficientfilteringalgorithmsforlocationawarepublis DE-627 ger DE-627 rakwb eng 620 530 000 DNB SA 5571 AVZ rvk 54.00 bkl Minghe Yu verfasserin aut Efficient Filtering Algorithms for Location-Aware Publish/Subscribe 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Location-based services have been widely adopted in many systems. Existing works employ a pull model or user-initiated model, where a user issues a query to a server which replies with location-aware answers. To provide users with instant replies, a push model or server-initiated model is becoming an inevitable computing model in the next-generation location-based services. In the push model, subscribers register spatio-textual subscriptions to capture their interests, and publishers post spatio-textual messages. This calls for a high-performance location-aware publish/subscribe system to deliver publishers' messages to relevant subscribers. In this paper, we address the research challenges that arise in designing a location-aware publish/subscribe system. We propose an R-tree based index by integrating textual descriptions into R-tree nodes. We devise efficient filtering algorithms and effective pruning techniques to achieve high performance. Our method can support both conjunctive queries and ranking queries. We discuss how to support dynamic updates efficiently. Experimental results show our method achieves high performance which can filter 500 messages in a second for 10 million subscriptions on a commodity computer. pruning techniques location-aware answers Time complexity next-generation location-based services middleware push model question answering (information retrieval) mobile computing ranking queries Semantics Computational modeling Indexes Subscriptions R-tree based index location-aware publish/subscribe system conjunctive queries spatio-textual messages server-initiated model R-tree nodes Keyword search information filtering efficient filtering algorithms subscribers register spatio-textual subscriptions Guoliang Li oth Ting Wang oth Jianhua Feng oth Zhiguo Gong oth Enthalten in IEEE transactions on knowledge and data engineering New York, NY : IEEE, 1989 27(2015), 4, Seite 950-963 (DE-627)130765732 (DE-600)1001468-8 (DE-576)023036060 1041-4347 nnns volume:27 year:2015 number:4 pages:950-963 http://dx.doi.org/10.1109/TKDE.2014.2349906 Volltext http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6880816 http://search.proquest.com/docview/1663304726 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-PHY SSG-OLC-MAT SSG-OPC-BBI SA 5571 54.00 AVZ AR 27 2015 4 950-963
allfieldsGer	10.1109/TKDE.2014.2349906 doi PQ20160617 (DE-627)OLC1958213578 (DE-599)GBVOLC1958213578 (PRQ)c1886-890ee9cdfc95c6a7c7072047e4a6d60340dc0bb9e12ce501e82da1cb3970ba970 (KEY)0175400920150000027000400950efficientfilteringalgorithmsforlocationawarepublis DE-627 ger DE-627 rakwb eng 620 530 000 DNB SA 5571 AVZ rvk 54.00 bkl Minghe Yu verfasserin aut Efficient Filtering Algorithms for Location-Aware Publish/Subscribe 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Location-based services have been widely adopted in many systems. Existing works employ a pull model or user-initiated model, where a user issues a query to a server which replies with location-aware answers. To provide users with instant replies, a push model or server-initiated model is becoming an inevitable computing model in the next-generation location-based services. In the push model, subscribers register spatio-textual subscriptions to capture their interests, and publishers post spatio-textual messages. This calls for a high-performance location-aware publish/subscribe system to deliver publishers' messages to relevant subscribers. In this paper, we address the research challenges that arise in designing a location-aware publish/subscribe system. We propose an R-tree based index by integrating textual descriptions into R-tree nodes. We devise efficient filtering algorithms and effective pruning techniques to achieve high performance. Our method can support both conjunctive queries and ranking queries. We discuss how to support dynamic updates efficiently. Experimental results show our method achieves high performance which can filter 500 messages in a second for 10 million subscriptions on a commodity computer. pruning techniques location-aware answers Time complexity next-generation location-based services middleware push model question answering (information retrieval) mobile computing ranking queries Semantics Computational modeling Indexes Subscriptions R-tree based index location-aware publish/subscribe system conjunctive queries spatio-textual messages server-initiated model R-tree nodes Keyword search information filtering efficient filtering algorithms subscribers register spatio-textual subscriptions Guoliang Li oth Ting Wang oth Jianhua Feng oth Zhiguo Gong oth Enthalten in IEEE transactions on knowledge and data engineering New York, NY : IEEE, 1989 27(2015), 4, Seite 950-963 (DE-627)130765732 (DE-600)1001468-8 (DE-576)023036060 1041-4347 nnns volume:27 year:2015 number:4 pages:950-963 http://dx.doi.org/10.1109/TKDE.2014.2349906 Volltext http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6880816 http://search.proquest.com/docview/1663304726 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-PHY SSG-OLC-MAT SSG-OPC-BBI SA 5571 54.00 AVZ AR 27 2015 4 950-963
allfieldsSound	10.1109/TKDE.2014.2349906 doi PQ20160617 (DE-627)OLC1958213578 (DE-599)GBVOLC1958213578 (PRQ)c1886-890ee9cdfc95c6a7c7072047e4a6d60340dc0bb9e12ce501e82da1cb3970ba970 (KEY)0175400920150000027000400950efficientfilteringalgorithmsforlocationawarepublis DE-627 ger DE-627 rakwb eng 620 530 000 DNB SA 5571 AVZ rvk 54.00 bkl Minghe Yu verfasserin aut Efficient Filtering Algorithms for Location-Aware Publish/Subscribe 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Location-based services have been widely adopted in many systems. Existing works employ a pull model or user-initiated model, where a user issues a query to a server which replies with location-aware answers. To provide users with instant replies, a push model or server-initiated model is becoming an inevitable computing model in the next-generation location-based services. In the push model, subscribers register spatio-textual subscriptions to capture their interests, and publishers post spatio-textual messages. This calls for a high-performance location-aware publish/subscribe system to deliver publishers' messages to relevant subscribers. In this paper, we address the research challenges that arise in designing a location-aware publish/subscribe system. We propose an R-tree based index by integrating textual descriptions into R-tree nodes. We devise efficient filtering algorithms and effective pruning techniques to achieve high performance. Our method can support both conjunctive queries and ranking queries. We discuss how to support dynamic updates efficiently. Experimental results show our method achieves high performance which can filter 500 messages in a second for 10 million subscriptions on a commodity computer. pruning techniques location-aware answers Time complexity next-generation location-based services middleware push model question answering (information retrieval) mobile computing ranking queries Semantics Computational modeling Indexes Subscriptions R-tree based index location-aware publish/subscribe system conjunctive queries spatio-textual messages server-initiated model R-tree nodes Keyword search information filtering efficient filtering algorithms subscribers register spatio-textual subscriptions Guoliang Li oth Ting Wang oth Jianhua Feng oth Zhiguo Gong oth Enthalten in IEEE transactions on knowledge and data engineering New York, NY : IEEE, 1989 27(2015), 4, Seite 950-963 (DE-627)130765732 (DE-600)1001468-8 (DE-576)023036060 1041-4347 nnns volume:27 year:2015 number:4 pages:950-963 http://dx.doi.org/10.1109/TKDE.2014.2349906 Volltext http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6880816 http://search.proquest.com/docview/1663304726 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-PHY SSG-OLC-MAT SSG-OPC-BBI SA 5571 54.00 AVZ AR 27 2015 4 950-963
language	English
source	Enthalten in IEEE transactions on knowledge and data engineering 27(2015), 4, Seite 950-963 volume:27 year:2015 number:4 pages:950-963
sourceStr	Enthalten in IEEE transactions on knowledge and data engineering 27(2015), 4, Seite 950-963 volume:27 year:2015 number:4 pages:950-963
format_phy_str_mv	Article
institution	findex.gbv.de
topic_facet	pruning techniques location-aware answers Time complexity next-generation location-based services middleware push model question answering (information retrieval) mobile computing ranking queries Semantics Computational modeling Indexes Subscriptions R-tree based index location-aware publish/subscribe system conjunctive queries spatio-textual messages server-initiated model R-tree nodes Keyword search information filtering efficient filtering algorithms subscribers register spatio-textual subscriptions
dewey-raw	620
isfreeaccess_bool	false
container_title	IEEE transactions on knowledge and data engineering
authorswithroles_txt_mv	Minghe Yu @@aut@@ Guoliang Li @@oth@@ Ting Wang @@oth@@ Jianhua Feng @@oth@@ Zhiguo Gong @@oth@@
publishDateDaySort_date	2015-01-01T00:00:00Z
hierarchy_top_id	130765732
dewey-sort	3620
id	OLC1958213578
language_de	englisch
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC1958213578</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230714144305.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">160206s2015 xx \|\|\|\|\| 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1109/TKDE.2014.2349906</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20160617</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1958213578</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1958213578</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)c1886-890ee9cdfc95c6a7c7072047e4a6d60340dc0bb9e12ce501e82da1cb3970ba970</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0175400920150000027000400950efficientfilteringalgorithmsforlocationawarepublis</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="a">530</subfield><subfield code="a">000</subfield><subfield code="q">DNB</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SA 5571</subfield><subfield code="q">AVZ</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.00</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Minghe Yu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Efficient Filtering Algorithms for Location-Aware Publish/Subscribe</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2015</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Location-based services have been widely adopted in many systems. Existing works employ a pull model or user-initiated model, where a user issues a query to a server which replies with location-aware answers. To provide users with instant replies, a push model or server-initiated model is becoming an inevitable computing model in the next-generation location-based services. In the push model, subscribers register spatio-textual subscriptions to capture their interests, and publishers post spatio-textual messages. This calls for a high-performance location-aware publish/subscribe system to deliver publishers' messages to relevant subscribers. In this paper, we address the research challenges that arise in designing a location-aware publish/subscribe system. We propose an R-tree based index by integrating textual descriptions into R-tree nodes. We devise efficient filtering algorithms and effective pruning techniques to achieve high performance. Our method can support both conjunctive queries and ranking queries. We discuss how to support dynamic updates efficiently. Experimental results show our method achieves high performance which can filter 500 messages in a second for 10 million subscriptions on a commodity computer.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">pruning techniques</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">location-aware answers</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Time complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">next-generation location-based services</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">middleware</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">push model</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">question answering (information retrieval)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">mobile computing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">ranking queries</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Semantics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational modeling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Indexes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Subscriptions</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">R-tree based index</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">location-aware publish/subscribe system</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">conjunctive queries</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">spatio-textual messages</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">server-initiated model</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">R-tree nodes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Keyword search</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">information filtering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">efficient filtering algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">subscribers register spatio-textual subscriptions</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Guoliang Li</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Ting Wang</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Jianhua Feng</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Zhiguo Gong</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">IEEE transactions on knowledge and data engineering</subfield><subfield code="d">New York, NY : IEEE, 1989</subfield><subfield code="g">27(2015), 4, Seite 950-963</subfield><subfield code="w">(DE-627)130765732</subfield><subfield code="w">(DE-600)1001468-8</subfield><subfield code="w">(DE-576)023036060</subfield><subfield code="x">1041-4347</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:27</subfield><subfield code="g">year:2015</subfield><subfield code="g">number:4</subfield><subfield code="g">pages:950-963</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1109/TKDE.2014.2349906</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6880816</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://search.proquest.com/docview/1663304726</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-BBI</subfield></datafield><datafield tag="936" ind1="r" ind2="v"><subfield code="a">SA 5571</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.00</subfield><subfield code="q">AVZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">27</subfield><subfield code="j">2015</subfield><subfield code="e">4</subfield><subfield code="h">950-963</subfield></datafield></record></collection>
author	Minghe Yu
spellingShingle	Minghe Yu ddc 620 rvk SA 5571 bkl 54.00 misc pruning techniques misc location-aware answers misc Time complexity misc next-generation location-based services misc middleware misc push model misc question answering (information retrieval) misc mobile computing misc ranking queries misc Semantics misc Computational modeling misc Indexes misc Subscriptions misc R-tree based index misc location-aware publish/subscribe system misc conjunctive queries misc spatio-textual messages misc server-initiated model misc R-tree nodes misc Keyword search misc information filtering misc efficient filtering algorithms misc subscribers register spatio-textual subscriptions Efficient Filtering Algorithms for Location-Aware Publish/Subscribe
authorStr	Minghe Yu
ppnlink_with_tag_str_mv	@@773@@(DE-627)130765732
format	Article
dewey-ones	620 - Engineering & allied operations 530 - Physics 000 - Computer science, information & general works
delete_txt_mv	keep
author_role	aut
collection	OLC
remote_str	false
illustrated	Not Illustrated
issn	1041-4347
topic_title	620 530 000 DNB SA 5571 AVZ rvk 54.00 bkl Efficient Filtering Algorithms for Location-Aware Publish/Subscribe pruning techniques location-aware answers Time complexity next-generation location-based services middleware push model question answering (information retrieval) mobile computing ranking queries Semantics Computational modeling Indexes Subscriptions R-tree based index location-aware publish/subscribe system conjunctive queries spatio-textual messages server-initiated model R-tree nodes Keyword search information filtering efficient filtering algorithms subscribers register spatio-textual subscriptions
topic	ddc 620 rvk SA 5571 bkl 54.00 misc pruning techniques misc location-aware answers misc Time complexity misc next-generation location-based services misc middleware misc push model misc question answering (information retrieval) misc mobile computing misc ranking queries misc Semantics misc Computational modeling misc Indexes misc Subscriptions misc R-tree based index misc location-aware publish/subscribe system misc conjunctive queries misc spatio-textual messages misc server-initiated model misc R-tree nodes misc Keyword search misc information filtering misc efficient filtering algorithms misc subscribers register spatio-textual subscriptions
topic_unstemmed	ddc 620 rvk SA 5571 bkl 54.00 misc pruning techniques misc location-aware answers misc Time complexity misc next-generation location-based services misc middleware misc push model misc question answering (information retrieval) misc mobile computing misc ranking queries misc Semantics misc Computational modeling misc Indexes misc Subscriptions misc R-tree based index misc location-aware publish/subscribe system misc conjunctive queries misc spatio-textual messages misc server-initiated model misc R-tree nodes misc Keyword search misc information filtering misc efficient filtering algorithms misc subscribers register spatio-textual subscriptions
topic_browse	ddc 620 rvk SA 5571 bkl 54.00 misc pruning techniques misc location-aware answers misc Time complexity misc next-generation location-based services misc middleware misc push model misc question answering (information retrieval) misc mobile computing misc ranking queries misc Semantics misc Computational modeling misc Indexes misc Subscriptions misc R-tree based index misc location-aware publish/subscribe system misc conjunctive queries misc spatio-textual messages misc server-initiated model misc R-tree nodes misc Keyword search misc information filtering misc efficient filtering algorithms misc subscribers register spatio-textual subscriptions
format_facet	Aufsätze Gedruckte Aufsätze
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	nc
author2_variant	g l gl t w tw j f jf z g zg
hierarchy_parent_title	IEEE transactions on knowledge and data engineering
hierarchy_parent_id	130765732
dewey-tens	620 - Engineering 530 - Physics 000 - Computer science, knowledge & systems
hierarchy_top_title	IEEE transactions on knowledge and data engineering
isfreeaccess_txt	false
familylinks_str_mv	(DE-627)130765732 (DE-600)1001468-8 (DE-576)023036060
title	Efficient Filtering Algorithms for Location-Aware Publish/Subscribe
ctrlnum	(DE-627)OLC1958213578 (DE-599)GBVOLC1958213578 (PRQ)c1886-890ee9cdfc95c6a7c7072047e4a6d60340dc0bb9e12ce501e82da1cb3970ba970 (KEY)0175400920150000027000400950efficientfilteringalgorithmsforlocationawarepublis
title_full	Efficient Filtering Algorithms for Location-Aware Publish/Subscribe
author_sort	Minghe Yu
journal	IEEE transactions on knowledge and data engineering
journalStr	IEEE transactions on knowledge and data engineering
lang_code	eng
isOA_bool	false
dewey-hundreds	600 - Technology 500 - Science 000 - Computer science, information & general works
recordtype	marc
publishDateSort	2015
contenttype_str_mv	txt
container_start_page	950
author_browse	Minghe Yu
container_volume	27
class	620 530 000 DNB SA 5571 AVZ rvk 54.00 bkl
format_se	Aufsätze
author-letter	Minghe Yu
doi_str_mv	10.1109/TKDE.2014.2349906
dewey-full	620 530 000
title_sort	efficient filtering algorithms for location-aware publish/subscribe
title_auth	Efficient Filtering Algorithms for Location-Aware Publish/Subscribe
abstract	Location-based services have been widely adopted in many systems. Existing works employ a pull model or user-initiated model, where a user issues a query to a server which replies with location-aware answers. To provide users with instant replies, a push model or server-initiated model is becoming an inevitable computing model in the next-generation location-based services. In the push model, subscribers register spatio-textual subscriptions to capture their interests, and publishers post spatio-textual messages. This calls for a high-performance location-aware publish/subscribe system to deliver publishers' messages to relevant subscribers. In this paper, we address the research challenges that arise in designing a location-aware publish/subscribe system. We propose an R-tree based index by integrating textual descriptions into R-tree nodes. We devise efficient filtering algorithms and effective pruning techniques to achieve high performance. Our method can support both conjunctive queries and ranking queries. We discuss how to support dynamic updates efficiently. Experimental results show our method achieves high performance which can filter 500 messages in a second for 10 million subscriptions on a commodity computer.
abstractGer	Location-based services have been widely adopted in many systems. Existing works employ a pull model or user-initiated model, where a user issues a query to a server which replies with location-aware answers. To provide users with instant replies, a push model or server-initiated model is becoming an inevitable computing model in the next-generation location-based services. In the push model, subscribers register spatio-textual subscriptions to capture their interests, and publishers post spatio-textual messages. This calls for a high-performance location-aware publish/subscribe system to deliver publishers' messages to relevant subscribers. In this paper, we address the research challenges that arise in designing a location-aware publish/subscribe system. We propose an R-tree based index by integrating textual descriptions into R-tree nodes. We devise efficient filtering algorithms and effective pruning techniques to achieve high performance. Our method can support both conjunctive queries and ranking queries. We discuss how to support dynamic updates efficiently. Experimental results show our method achieves high performance which can filter 500 messages in a second for 10 million subscriptions on a commodity computer.
abstract_unstemmed	Location-based services have been widely adopted in many systems. Existing works employ a pull model or user-initiated model, where a user issues a query to a server which replies with location-aware answers. To provide users with instant replies, a push model or server-initiated model is becoming an inevitable computing model in the next-generation location-based services. In the push model, subscribers register spatio-textual subscriptions to capture their interests, and publishers post spatio-textual messages. This calls for a high-performance location-aware publish/subscribe system to deliver publishers' messages to relevant subscribers. In this paper, we address the research challenges that arise in designing a location-aware publish/subscribe system. We propose an R-tree based index by integrating textual descriptions into R-tree nodes. We devise efficient filtering algorithms and effective pruning techniques to achieve high performance. Our method can support both conjunctive queries and ranking queries. We discuss how to support dynamic updates efficiently. Experimental results show our method achieves high performance which can filter 500 messages in a second for 10 million subscriptions on a commodity computer.
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-PHY SSG-OLC-MAT SSG-OPC-BBI
container_issue	4
title_short	Efficient Filtering Algorithms for Location-Aware Publish/Subscribe
url	http://dx.doi.org/10.1109/TKDE.2014.2349906 http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6880816 http://search.proquest.com/docview/1663304726
remote_bool	false
author2	Guoliang Li Ting Wang Jianhua Feng Zhiguo Gong
author2Str	Guoliang Li Ting Wang Jianhua Feng Zhiguo Gong
ppnlink	130765732
mediatype_str_mv	n
isOA_txt	false
hochschulschrift_bool	false
author2_role	oth oth oth oth
doi_str	10.1109/TKDE.2014.2349906
up_date	2024-07-04T02:22:10.875Z
_version_	1803613352364081152
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC1958213578</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230714144305.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">160206s2015 xx \|\|\|\|\| 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1109/TKDE.2014.2349906</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20160617</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1958213578</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1958213578</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)c1886-890ee9cdfc95c6a7c7072047e4a6d60340dc0bb9e12ce501e82da1cb3970ba970</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0175400920150000027000400950efficientfilteringalgorithmsforlocationawarepublis</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="a">530</subfield><subfield code="a">000</subfield><subfield code="q">DNB</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SA 5571</subfield><subfield code="q">AVZ</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.00</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Minghe Yu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Efficient Filtering Algorithms for Location-Aware Publish/Subscribe</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2015</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Location-based services have been widely adopted in many systems. Existing works employ a pull model or user-initiated model, where a user issues a query to a server which replies with location-aware answers. To provide users with instant replies, a push model or server-initiated model is becoming an inevitable computing model in the next-generation location-based services. In the push model, subscribers register spatio-textual subscriptions to capture their interests, and publishers post spatio-textual messages. This calls for a high-performance location-aware publish/subscribe system to deliver publishers' messages to relevant subscribers. In this paper, we address the research challenges that arise in designing a location-aware publish/subscribe system. We propose an R-tree based index by integrating textual descriptions into R-tree nodes. We devise efficient filtering algorithms and effective pruning techniques to achieve high performance. Our method can support both conjunctive queries and ranking queries. We discuss how to support dynamic updates efficiently. Experimental results show our method achieves high performance which can filter 500 messages in a second for 10 million subscriptions on a commodity computer.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">pruning techniques</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">location-aware answers</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Time complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">next-generation location-based services</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">middleware</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">push model</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">question answering (information retrieval)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">mobile computing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">ranking queries</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Semantics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational modeling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Indexes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Subscriptions</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">R-tree based index</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">location-aware publish/subscribe system</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">conjunctive queries</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">spatio-textual messages</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">server-initiated model</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">R-tree nodes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Keyword search</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">information filtering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">efficient filtering algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">subscribers register spatio-textual subscriptions</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Guoliang Li</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Ting Wang</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Jianhua Feng</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Zhiguo Gong</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">IEEE transactions on knowledge and data engineering</subfield><subfield code="d">New York, NY : IEEE, 1989</subfield><subfield code="g">27(2015), 4, Seite 950-963</subfield><subfield code="w">(DE-627)130765732</subfield><subfield code="w">(DE-600)1001468-8</subfield><subfield code="w">(DE-576)023036060</subfield><subfield code="x">1041-4347</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:27</subfield><subfield code="g">year:2015</subfield><subfield code="g">number:4</subfield><subfield code="g">pages:950-963</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1109/TKDE.2014.2349906</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6880816</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://search.proquest.com/docview/1663304726</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-BBI</subfield></datafield><datafield tag="936" ind1="r" ind2="v"><subfield code="a">SA 5571</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.00</subfield><subfield code="q">AVZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">27</subfield><subfield code="j">2015</subfield><subfield code="e">4</subfield><subfield code="h">950-963</subfield></datafield></record></collection>
score	7.401101

Nicht das Richtige dabei?

Schreiben Sie uns!

Efficient Filtering Algorithms for Location-Aware Publish/Subscribe

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?